Sparse hypergraphs and pebble game algorithms

European Journal of Combinatorics

Volumn 30, Issue 8, 2009, Pages 1944-1964

  Streinu, Ileana ^a   Theran, Louis ^b  

^a SMITH COLLEGE   (United States)

^b University of Massachusetts Amherst   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 70349322711     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejc.2008.12.018     Document Type: Article

References (27)

1. Berg A.R., and Jordan T. Algorithms for graph rigidity and scene analysis. In: Battista G.D., and Zwick U. (Eds). ESA, Algorithms - ESA 2003, 11th Annual European Symposium, Budapest, Hungary. Lecture Notes in Computer Science vol. 2832 (2003), Springer
2. Edmonds J. Minimum partition of a matroid into independent sets. J. Res. Nat. Bur. Standards Sect. B 69B (1965) 67-72
3. Edmonds J. Submodular functions, matroids and certain polyhedra. Combinatorial Structures and their Applications (1970), Gordon and Breach, New York 69-87
4. Frank A., Király T., and Kriesell A. On decomposing a hypergraph into k connected subhypergraphs. Discrete Appl. Math. 131 (2003)
5. Gabow H., and Westermann H.H. Forests, frames, and games: Algorithms for matroid sums and applications. Algorithmica 7 1 (1992) 465-497
6. Gabow H.N. A matroid approach to finding edge connectivity and packing arborescences. J. Comput. System Sci. 50 (1995)
7. Haas R. Characterizations of arboricity of graphs. Ars Combin. 63 (2002) 129-137
8. B. Hendrickson, The molecule problem: Determining conformation from pairwise distances, Ph.D. Thesis, Cornell University, 1991
9. Jacobs D.J., and Hendrickson B. An algorithm for two dimensional rigidity percolation: The pebble game. J. Comput. Phys. 137 (1997) 346-365
10. Laman G. On graphs and rigidity of plane skeletal structures. J. Eng. Math. (Historical Archive) 4 4 (1970) 331-340
11. Lee A., and Streinu I. Pebble game algorithms and sparse graphs. Discrete Math. 308 8 (2008) 1425-1437
12. Lee A., Streinu I., and Theran L. Graded sparse graphs and matroids. J. Univ. Comput. Sci. 13 10 (2007)
13. A. Lee, I. Streinu, L. Theran, Finding and maintaining rigid components, in: Proceeding of the Canadian Conference of Computational Geometry, Windsor, Ontario, 2005
14. M. Lorea, Hypergraphes et matroïdes, Technical Report, Cahiers Centre Etud. Rech. Oper., 1975
15. Lovász L. A generalization of König's theorem. Acta Math. Hungarica 21 (1970) 443-446
16. Lovász L., and Yemini Y. On generic rigidity in the plane. SIAM J. Algebraic Discrete Methods 3 1 (1982) 91-98
17. Nash-Williams C.S.A. Edge-disjoint spanning trees of finite graphs. J. London Math. Soc. 36 (1961) 445-450
18. Oxley J.G. Matroid Theory (1992), Oxford University Press, New York
19. Pym J.S., and Perfect H. Submodular functions and independence structures. J. Math. Anal. Appl. 30 (1970) 1-31
20. Recski A. A network theory approach to the rigidity of skeletal structures I. Modelling and interconnection. Discrete Appl. Math. 7 (1984) 313-324
21. Recski A. A network theory approach to the rigidity of skeletal structures II. Laman's theorem and topological formulae. Discrete Appl. Math. 8 (1984) 63-68
22. L. Szego{double acute}, On constructive characterizations of (k, l)-sparse graphs, Technical Report TR 2003-10, Egerváry Research Group, Eötvös University, Budapest, Hungary, 2003
23. T.-S. Tay, Rigidity problems in bar and joint frameworks, Ph.D. Thesis, Department of Pure Mathematics, University of Waterloo, 1980
24. Tay T.-S. Rigidity of multigraphs I: Linking rigid bodies in n-space. J. Combin. Theory Ser. B 26 (1984) 95-112
25. Tutte W.T. On the problem of decomposing a graph into n connected factors. J. London Math. Soc. 142 (1961) 221-230
26. Whiteley W. Some matroids from discrete applied geometry. In: Bonin J.O.J., and Servatius B. (Eds). Matroid Theory. Contemporary Mathematics vol. 197 (1996), American Mathematical Society 171-311
27. Whiteley W. The union of matroids and the rigidity of frameworks. SIAM J. Discrete Math. 1 2 (1988) 237-255