Found 50 Documents (Results 1–50)
Empirical study on sufficient numbers of minimum cuts in strongly connected directed random graphs. (English) Zbl 07769709
MSC:
05-XX
Multi-budgeted directed cuts. (English) Zbl 1477.68236
Reviewer: Petr Kolman (Praha)
FPT inapproximability of directed cut and connectivity problems. (English) Zbl 07650216
Jansen, Bart M. P. (ed.) et al., 14th international symposium on parameterized and exact computation, IPEC 2019, Munich, Germany, September 11–13, 2019. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 148, Article 8, 20 p. (2019).
Multi-budgeted directed cuts. (English) Zbl 1477.68237
Paul, Christophe (ed.) et al., 13th international symposium on parameterized and exact computation, IPEC 2018, August 22–24, 2018, Helsinki, Finland. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 115, Article 18, 14 p. (2019).
Global and fixed-terminal cuts in digraphs. (English) Zbl 1467.68134
Jansen, Klaus (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 20th international workshop, APPROX 2017 and 21st international workshop, RANDOM 2017, Berkeley, CA, USA, August 16–18, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 81, Article 2, 20 p. (2017).
Covering the edges of digraphs in \(\mathcal D(3,3)\) and \(\mathcal D(4,4)\) with directed cuts. (English) Zbl 1242.05105
Problems of synthesis of connected networks with respect to isomorphic subgraphs. (English. Russian original) Zbl 1075.05040
Cybern. Syst. Anal. 40, No. 5, 735-738 (2004); translation from Kibern. Sist. Anal. 2004, No. 5, 126-131 (2004).
Note on directed odd or even minimum \((s,t)\)-cut problem and generalizations. (English) Zbl 1073.05578
Reviewer: Petr Kolman (Praha)
Finding and using directed cuts of real graphs of algorithms. (English. Russian original) Zbl 0973.68513
Program. Comput. Softw. 23, No. 4, 230-237 (1997); translation from Programmirovanie 1997, No. 4, 71-80 (1997).
MSC:
68N19
A refinement of the Frank-Sebö-Tardos theorem and its applications. (English. Russian original) Zbl 0835.05054
Korshunov, A. D. (ed.): Discrete analysis and operations research. Mathematics and its Applications 355, 109-123 (1996); translation from Sib. Zh. Issled. Oper. 1, No. 3, 3-19 (1994).
Reviewer: M.Knor (Bratislava)
Maximum cuts and quasirandom graphs. (English) Zbl 0823.05051
Frieze, Alan (ed.) et al., Random graphs. Volume 2. Based on papers presented at the fourth international seminar on random graphs and probabilistic methods in combinatorics, held in Poznań, Poland, August 7-11, 1989. Chichester: Wiley. Wiley- Interscience Publication. 23-33 (1992).
Reviewer: E.M.Palmer (East Lansing)
A method of constructing minimal failure cuts. (English. Russian original) Zbl 0800.68616
Cybernetics 27, No. 3, 320-323 (1991); translation from Kibernetika 1991, No. 3, 8-10, 31 (1991).
Canonical equation sets for classes of concordant polytopes. (English) Zbl 0734.90075
Reviewer: R.Euler (Brest)
A process for determining minimal cuts in an oriented network. (Romanian. French summary) Zbl 0839.05055
Contours and directed cuts in directed graphs. (Russian) Zbl 0673.05040
Reviewer: V.Fleischer
MSC:
05C20
Minimal mean weight cuts and cycles in directed graphs. (English. Russian original) Zbl 0806.05034
Transl., Ser. 2, Am. Math. Soc. 158, 47-55 (1994); translation from Klimov, V. S. (ed.), Qualitative and approximate methods in the study of operator equations, Yaroslavl’, 72-83 (1985).
Reviewer: G.Chaty (Paris)
Segregations and cuts of directed graphs. (Turkish. English summary) Zbl 0611.05027
Fen Fak. Derg. 1985, Spec. Issue 2, 283-292 (1985).
MSC:
05C20
Matroids from crossing families. (English) Zbl 0571.05011
Finite and infinite sets, 6th Hung. Combin. Colloq., Eger/Hung. 1981, Vol. I, Colloq. Math. Soc. János Bolyai 37, 295-304 (1984).
Reviewer: A.Recski
MSC:
05B35
Min-max results in combinatorial optimization. (English) Zbl 0542.90067
Mathematical programming, 11th int. Symp., Bonn 1982, 439-500 (1983).
The complexity of counting cuts and of computing the probability that a graph is connected. (English) Zbl 0524.68041
Lattice polyhedra II: Generalization, constructions and examples. (English) Zbl 0507.90062
Ann. Discrete Math. 15, 189-203 (1982).
An \(O(K\cdot n^4)\) algorithm for finding the \(K\) best cuts in a network. (English) Zbl 0505.90023
An algorithm for submodular functions on graphs. (English) Zbl 0504.05059
Ann. Discrete Math. 16, 97-120 (1982).
The ellipsoid method and its consequences in combinatorial optimization. (English) Zbl 0539.90078
IIASA Collab. Proc. Ser. CP-81-S1, 511-546 (1981).
Some combinatorial applications of the new linear programming algorithm. (English) Zbl 0523.90064
Combinatorics and graph theory, Proc. Symp., Calcutta 1980, Lect. Notes Math. 885, 33-41 (1981).
Filter Results by …
Document Type
- Journal Articles (40)
- Collection Articles (10)
all
top 5
Author
- Schrijver, Alexander (4)
- Frank, András (3)
- Lovász, László (3)
- Tardos, Éva (3)
- Gollin, J. Pascal (2)
- Grötschel, Martin (2)
- Gusfield, Dan (2)
- Heuer, Karl (2)
- Kratsch, Stefan (2)
- Li, Shaohua (2)
- Marx, Dániel (2)
- Picard, Jean-Claude (2)
- Pilipczuk, Marcin L. (2)
- Queyranne, Maurice (2)
- Wahlström, Magnus (2)
- Zhang, Shenggui (2)
- Alekseev, D. A. (1)
- Arai, Tadashi (1)
- Arasoy, Mehmet (1)
- Ashkboos, Saleh (1)
- Bai, Yandong (1)
- Bakoglu, Hüsamettin (1)
- Ball, Michael O. (1)
- Benczúr, András A. (1)
- Bérczi, Kristóf (1)
- Bolla, Marianna (1)
- Burlacu, Eugen (1)
- Burlacu, Veronica (1)
- Cenusa, Gheorghe (1)
- Chambers, Erin Wolf (1)
- Chandrasekaran, Karthekeyan (1)
- Chen, Beifang (1)
- Chen, Guantao (1)
- Chiaselotti, Giampiero (1)
- Chitnis, Rajesh Hemant (1)
- Chung, Fan (1)
- Dambitis, Janis (1)
- Escudero, Laureano Fernando (1)
- Feldmann, Andreas Emil (1)
- Fox, Kyle (1)
- Fülöp, Ottilia (1)
- Gallo, Giorgio (1)
- Gentile, Tommaso (1)
- Graham, Ronald Lewis (1)
- Gröflin, Heinz (1)
- Gu, Manzhan (1)
- Gupta, Anushka (1)
- Hamacher, Horst W. (1)
- Hoffman, Alan J. (1)
- Hsu, Po-Ya (1)
- Ivantschev, D. T. (1)
- Jarvis, John J. (1)
- Kajitani, Yoji (1)
- Karzanov, Aleksandr V. (1)
- Kato, Keiju (1)
- Kavitha, Telikepalli (1)
- Király, Tamás (1)
- Kostochka, Aleksandr Vasil’evich (1)
- Lee, Euiwoong (1)
- Lee, Jon (1)
- Li, Binlong (1)
- Li, Nana (1)
- Longo, Giustino (1)
- Lu, You (1)
- Manchon, Dominique (1)
- Moffitt, Amanda (1)
- Naor, Dalit (1)
- Nayyeri, Amir (1)
- Nešetřil, Jaroslav (1)
- Neumaier, Arnold (1)
- Nguyen, Sang (1)
- Omidi, Gholam Reza (1)
- Ortuño, M. Teresa (1)
- Pallottino, Stefano (1)
- Provan, J. Scott (1)
- Ren, Alissa (1)
- Sebo, András (1)
- Shafiei, Fateme (1)
- Sharifov, F. A. (1)
- Shcherbina, Oleg Aleksandrovich (1)
- Stavropoulos, Konstantinos S. (1)
- Tajbakhsh, Khosro (1)
- Tsaur, Irene (1)
- Tufekci, Suleyman (1)
- Ueno, Shuichi (1)
- Wang, Jue (1)
- Wang, Samuel K. (1)
- Xu, Chao (1)
- Xu, Chuandong (1)
all
top 5
Serial
- Discrete Appl. Math. (4)
- Discrete Math. (3)
- Algorithmica (3)
- J. Graph Theory (2)
- Math. Program. Study (2)
- SIAM J. Comput. (2)
- Latv. Mat. Ezheg. (1)
- Ars Comb. (1)
- INFOR (1)
- Math. Program. (1)
- Networks (1)
- Osaka J. Math. (1)
- Program. Comput. Softw. (1)
- Theor. Comput. Sci. (1)
- Cybernetics (1)
- Eur. J. Comb. (1)
- Oper. Res. Lett. (1)
- Combinatorica (1)
- Discrete Comput. Geom. (1)
- Lucr. Semin. Mat. Fiz. (1)
- C. R. Acad. Bulg. Sci. (1)
- Math. Program. (1)
- Cybern. Syst. Anal. (1)
- Sib. Zh. Issled. Oper. (1)
- Electron. J. Comb. (1)
- Top (1)
- Confluentes Math. (1)
- Comb. Theory (1)
