Recent results on well-balanced orientations
暂无分享,去创建一个
Satoru Iwata | Zoltán Király | Zoltán Szigeti | Attila Bernáth | Tamás Király | S. Iwata | Z. Szigeti | Tamás Király | Z. Király | Attila Bernáth
[1] Zoltán Király,et al. Simultaneous well-balanced orientations of graphs , 2006, J. Comb. Theory, Ser. B.
[2] Steffen Enni,et al. A note on mixed graphs and directed splitting off , 1998, J. Graph Theory.
[3] L. Lovász. Combinatorial problems and exercises , 1979 .
[4] W. Mader. A Reduction Method for Edge-Connectivity in Graphs , 1978 .
[5] Wolfgang Mader,et al. Konstruktion aller n-fach kantenzusammenhängenden Digraphen , 1982, Eur. J. Comb..
[6] Andrr As Frank,et al. Orientations of Graphs and Submodular Flows , 1996 .
[7] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[8] C. Nash-Williams. On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs , 1960, Canadian Journal of Mathematics.
[9] W. Mader. Ecken vom Innen- und Außengradn in minimaln-fach kantenzusammenhängenden Digraphen , 1974 .
[10] Satoru Iwata,et al. On well-balanced orientations , 2005 .
[11] András Frank,et al. On a theorem of Mader , 1992, Discret. Math..
[12] A. Frank. Applications of submodular functions , 1993 .
[13] Konstantin Salikhov. On the orientation of graphs , 2000, math/0012252.
[14] Katta G. Murty,et al. Mathematical programming: State of the art 1994 , 1994 .
[15] Harold N. Gabow,et al. Efficient splitting off algorithms for graphs , 1994, STOC '94.
[16] David S. Johnson,et al. The Planar Hamiltonian Circuit Problem is NP-Complete , 1976, SIAM J. Comput..
[17] András Frank,et al. A note on k-strongly connected orientations of an undirected graph , 1982, Discret. Math..
[18] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[19] J. Edmonds,et al. A Min-Max Relation for Submodular Functions on Graphs , 1977 .
[20] Attila Bernáth. Hardness results for well-balanced orientations , 2006 .
[21] Gwenaël Joret,et al. Well-balanced orientations of mixed graphs , 2008, Inf. Process. Lett..