Edge-connectivity of undirected and directed hypergraphs

More documents

Recommendations

Info

134 Bibliography [38] S. Fujishige, Structures of polyhedra determined by submodular functions on crossing families, Mathematical Programming 29 (1984), 125–141. [39] H.N. Gabow, Efficient splitting off algorithms for graphs, in: Proceedings of the 26th ACM Symposium on Theory of Computing, 696–705. [40] G. Gallo, G. Longo, S. Nguyen and S. Pallottino, Directed hypergraphs and applica- tions, Discrete Appl. Math. 40 (1993), 177–201. [41] G. Gallo, M.G. Scutellà, Directed Hypergraphs as a Modelling Paradigm, Rivista AMASES 21 (1998), 97–123. [42] R.E. Gomory, T.C. Hu, Multi-terminal network flows, SIAM J. Appl. Math 9 (1961) 551-570. [43] M. Grötschel, L. Lovász, A. Schrijver, The ellipsoid algorithm and its consequences in combinatorial optimization, Combinatorica 1 (1981), 499–513. [44] S.L. Hakimi, On the degrees of the vertices of a directed graph, Journal of the Franklin Institute 279 No. 4 (1965), 290–308. [45] S. Iwata, L. Fleischer, S. Fujishige, A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions, J. ACM 48 (2001), 761–777. [46] K. Jain, M. Mahdian, M.R. Salavatipour, Packing Steiner trees, SODA 2003. [47] T. Jordán, Two NP-complete augmentation problems, IMADA, Odense Universitet Preprints No. 8/1997. [48] T. Jordán, Constrained edge-splitting problems, SIAM J. Discrete Math., to appear. [49] T. Jordán, Z. Szigeti, Detachments preserving local edge-connectivity of graphs, SIAM J. Discrete Math., to appear. [50] S. Khanna, J. Naor and F. B. Shepherd, Directed network design with orientation con- straints, in: Proceedings of the Eleventh Annual ACM–SIAM Symposium on Discrete Algorithms (2000), 663–671. [51] T. Király, Covering symmetric supermodular functions by uniform hypergraphs, submitted (Journal of Combinatorial Theory Series B). [52] T. Király, M. Makai, A note on hypergraph connectivity augmentation, EGRES Tech- nical Report no. 2002-11.
Bibliography 135 [53] M. Kriesell, Local spanning trees in graphs and hypergraph decomposition with respect to edge-connectivity, Report 257 University of Hannover (1999), Submitted for publi- cation. [54] M. Lorea, Hypergraphes et matroides, Cahiers Centre Etud. Rech. Oper. 17 (1975), 289–291. [55] L. Lovász, Combinatorial Problems and Exercises, North-Holland (1979). [56] L. Lovász, A generalization of Kőnig’s theorem, Acta. Math. Acad. Sci. Hungar. 21 (1970), 443–446. [57] L. Lovász, Flats in matroids and geometric graphs, in: Combinatorial Surveys, Pro- ceedings of the 6th British Combinatorial Conference, Academic Press, London, 1977, 45–86. [58] W. Mader, A reduction method for edge-connectivity in graphs, Ann. Discrete Math. 3 (1978), 145–164. [59] W. Mader, Konstruktion aller n-fach kantenzusammenhängenden Digraphen, Europ. J. Combinatorics 3 (1982), 63–67. [60] H. Nagamochi, P. Eades, Edge-splitting and edge-connectivity augmentation in planar graphs, IPCO IV Springer LNCS 1412, R.E. Bixby et al, eds. (1998), 96–111. [61] C.St.J.A. Nash-Williams, On orientations, connectivity and odd vertex pairings in finite graphs, Canad. J. Math. 12 (1960), 555–567. [62] C.St.J.A Nash-Williams, Well-balanced orientations of finite graphs and unobtrusive odd-vertex pairings, in: Recent Progress in Combinatorics (ed. W.T. Tutte), Academic Press (1969), 133–149. [63] C.St.J.A. Nash-Williams, Decomposition of finite graphs into forests, J. London Math. Soc. 39 (1964), 12. [64] J. Plesnik, Minimum block containing a given graph, Archiv der mathematik Vol. XXVII (1976), 668–672. [65] H. E. Robbins, A theorem on graphs with an application to a problem of traffic control, American Math. Monthly 46 (1939), 281–283.
Page 1:
Edge-connectivity of undirected and
Page 4 and 5:
4 Contents 6 Hypergraph orientation
Page 6 and 7:
6 Contents
Page 8 and 9:
8 Chapter 1. Introduction and preli
Page 10 and 11:
10 Chapter 1. Introduction and prel
Page 12 and 13:
Page 14 and 15:
Page 16 and 17:
Page 18 and 19:
Page 20 and 21:
Page 22 and 23:
Page 24 and 25:
Page 26 and 27:
Page 28 and 29:
28 Chapter 2. Submodular functions
Page 30 and 31:
Page 32 and 33:
Page 34 and 35:
Page 36 and 37:
Page 38 and 39:
Page 40 and 41:
Page 42 and 43:
Page 44 and 45:
Page 46 and 47:
Page 48 and 49:
48 Chapter 3. Edge-connectivity aug
Page 50 and 51:
Page 52 and 53:
Page 54 and 55:
Page 56 and 57:
Page 58 and 59:
Page 60 and 61:
Page 62 and 63:
Page 64 and 65:
Page 66 and 67:
Page 68 and 69:
Page 70 and 71:
70 Chapter 4. Connectivity augmenta
Page 72 and 73:
Page 74 and 75:
Page 76 and 77:
Page 78 and 79:
Page 80 and 81:
Page 82 and 83:
Page 84 and 85: 84 Chapter 5. Partition-connectivit
Page 96 and 97: 96 Chapter 6. Hypergraph orientatio
Page 98 and 99: 98 Chapter 6. Hypergraph orientatio
Page 100 and 101: 100 Chapter 6. Hypergraph orientati
Page 116 and 117: 116 Chapter 7. Combined augmentatio
Page 130 and 131: 130 Chapter 8. Concluding remarks w
Page 132 and 133: 132 Bibliography [11] E. Cheng, Edg
Page 136 and 137: 136 Bibliography [66] A. Schrijver,
Page 138 and 139: 138 Index in-degree of node, 19 ind
Page 140 and 141: 140 Index h(a) the head node of the
Page 142 and 143: 142 Index
show all

Edge-connectivity of undirected and directed hypergraphs

Create successful ePaper yourself

Delete template?

Save as template?