Edge-connectivity of undirected and directed hypergraphs

132 Bibliography
[11] E. Cheng, Edge-augmentation of hypergraphs, in: Connectivity Augmentation of Net-
works: Structures and Algorithms, Mathematical Programming (ed. A. Frank), Ser.
B, Vol. 84, No. 3 (1999), 443–465.
[12] B. Cosh, B. Jackson, Z. Király, Local connectivity augmentation is NP-complete, ap-
peared in: B. Cosh: Vertex splitting and connectivity augmentation in hypergraphs,
Ph.D. thesis, Goldsmiths College, University of London (2000).
[13] J. Edmonds, Minimum partition of a matroid into independent sets, J. Res. Nat. Bur.
Standards Sect. 869 (1965), 67–72.
[14] J. Edmonds, Edge-disjoint branchings, in: B. Rustin, ed., Combinatorial Algorithms
(Acad. Press, New York, 1973) 91–96.
[15] J. Edmonds, Submodular functions, matroids, and certain polyhedra, in: R. Guy,
H. Hanani, N. Sauer, and J. Schönheim (eds.): Combinatorial Structures and their
Applications. Gordon and Breach, New York (1970), 69–87.
[16] J. Edmonds, Existence of k-edge-connected ordinary graphs with prescribed degrees, J.
Res. Nat. Bur. Standards Sect. B 68B (1964), 73–74.
[17] J. Edmonds, R. Giles, A min-max relation for submodular functions on graphs, Ann.
Discrete Math. 1 (1977), 185–204.
[18] L.P. Eswaran, R.E. Tarjan, Augmentation problems, SIAM J. Computing 5 No. 4
(1976), 653–665.
[19] B. Fleiner, Detachment of vertices preserving edge-connectivity, SIAM J. Discrete
Math., to appear.
[20] T. Fleiner, T. Jordán, Coverings and structure of crossing families, in: Connectivity
Augmentation of Networks: Structures and Algorithms, Mathematical Programming
(ed. A. Frank), Ser. B, Vol. 84, No. 3 (1999), 505–518.
[21] L.R. Ford, D.R. Fulkerson, Flows in Networks, Princeton Univ. Press, Princeton NJ.,
1962.
[22] A. Frank, On the orientation of graphs, J. Combinatorial Theory B 28 No. 3 (1980),
251–261.
[23] A. Frank, Finding feasible vectors of Edmonds-Giles polyhedra, Journal of Combina-
torial Theory Series B 36 (1984), 221–239.