András Frank
Cím
Hivatkozott rá
Hivatkozott rá
Év
Augmenting graphs to meet edge-connectivity requirements
A Frank
SIAM Journal on Discrete Mathematics 5 (1), 25-53, 1992
4421992
An application of simultaneous diophantine approximation in combinatorial optimization
A Frank, É Tardos
Combinatorica 7 (1), 49-65, 1987
3261987
Connections in combinatorial optimization
A Frank
OUP Oxford, 2011
2892011
Packing paths, circuits, and cuts-a survey
A Frank
Paths, flows, and VLSI-layout, 47-100, 1990
231*1990
Generalized polymatroids and submodular flows
A Frank, É Tardos
Mathematical Programming 42 (1), 489-563, 1988
2041988
An algorithm for submodular functions on graphs
A Frank
Bonn Workshop on Combinatorial Optimization (Bonn, 1980) 16, 97-120, 1982
1801982
Minimal edge-coverings of pairs of sets
A Frank, T Jordán
Journal of Combinatorial Theory, Series B 65 (1), 73-110, 1995
1761995
Connectivity augmentation problems in network design
A Frank
Univ. of Michigan, Ann Arbor, MI (United States), 1994
1721994
A weighted matroid intersection algorithm
A Frank
Journal of Algorithms 2 (4), 328-336, 1981
1701981
An application of submodular flows
A Frank, É Tardos
Linear algebra and its applications 114, 329-348, 1989
1631989
On Kuhn's Hungarian method—a tribute from Hungary
A Frank
Naval Research Logistics (NRL) 52 (1), 2-5, 2005
1622005
Some polynomial algorithms for certain graphs and hypergraphs
A Frank
1591976
On chain and antichain families of a partially ordered set
A Frank
Journal of Combinatorial Theory, Series B 29 (2), 176-184, 1980
1241980
Connectivity and network flows
A Frank
Handbook of combinatorics 1, 111-177, 1995
1221995
Disjoint paths in a rectilinear grid
A Frank
Combinatorica 2 (4), 361-371, 1982
1191982
On decomposing a hypergraph into k connected sub-hypergraphs
A Frank, T Király, M Kriesell
Discrete Applied Mathematics 131 (2), 373-383, 2003
1182003
Edge-disjoint paths in planar graphs
A Frank
Journal of Combinatorial Theory, Series B 39 (2), 164-178, 1985
1131985
On the orientation of graphs
A Frank
Journal of Combinatorial Theory, Series B 28 (3), 251-261, 1980
1131980
How to orient the edges of a graph?
A Frank, A Gyárfás
Combinatorics, 353-364, 1978
1091978
Kernel systems of directed graphs
A Frank
Acta Sci. Math.(Szeged) 41 (1-2), 63-76, 1979
1051979
A rendszer jelenleg nem tudja elvégezni a műveletet. Próbálkozzon újra később.
Cikkek 1–20