Pebble game algorithms and sparse graphs

Discrete Mathematics

Volumn 308, Issue 8, 2008, Pages 1425-1437

  Lee, Audrey ^a   Streinu, Ileana ^b  

^a Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

^b SMITH COLLEGE   (United States)

Author keywords

Circuit; Henneberg sequence; Matroid; Pebble game; Rigidity; Sparse graph

Indexed keywords

ALGORITHMS; GAME THEORY; INTEGER PROGRAMMING;

EFFICIENT ALGORITHMS; HENNEBERG SEQUENCE; PEBBLE GAME;

GRAPH THEORY;

EID: 38749117882     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2007.07.104     Document Type: Article

References (30)

1. S. Bereg, Certifying and constructing minimally rigid graphs in the plane, in: Proceedings of the 21st Annual ACM Symposium on Computational Geometry, 2005, pp. 73-80.
2. A. Berg, T. Jordán, Algorithms for graph rigidity and scene analysis, in: Proceedings of the 11th ESA, Lecture Notes in Computer Science, vol. 2832, Springer, Berlin, 2003, pp. 78-89.
3. Cormen T.H., Leiserson C.E., and Rivest R.L. Introduction to Algorithms (1990), McGraw-Hill, New York
4. Edmonds J. Edge-disjoint branchings. In: Rustin B. (Ed). Combinatorial Algorithms (1973), Academic Press, New York 91-96
5. Fekete Z., and Szegö L. A note on [k, l]-sparse graphs, TR 2005-05, Egerváry Research Group (2005), Eötvös University, Budapest, Hungary
6. Frank A., and Szegö L. Constructive characterizations for packing and covering with trees. Discrete Appl. Math. 131 2 (2003) 347-371
7. H. Gabow, H. Westermann, Forests, frames, and games: algorithms for matroid sums and applications, in: Proceedings of STOC'88, 1988, pp. 407-421.
8. H.N. Gabow, A matroid approach to finding edge connectivity and packing arborescences. in: Proceedings of STOC'91, 1991, pp. 112-122.
9. Haas R. Characterizations of arboricity of graphs. Ars Combin. 63 (2002) 129-137
10. B. Hendrickson, The molecule problem: determining conformation from pairwise distances, Ph.D. Thesis, Cornell University, 1991.
11. Hendrickson B. Conditions for unique graph realizations. SIAM J. Comput. 21 1 (1992) 65-84
12. Hendrickson B. The molecule problem: exploiting structure in global optimization. SIAM J. Optim. 5 4 (1995) 835-857
13. E.L. Henneberg, Die graphische Statik der starren Systeme, Johnson Reprint 1968. Leipzig, 1911.
14. Jacobs D.J., and Hendrickson B. An algorithm for two-dimensional rigidity percolation: the pebble game. J. Comput. Phys. 137 (1997) 346-365
15. Jacobs D.J., Rader A., Thorpe M., and Kuhn L.A. Protein flexibilty predictions using graph theory. Proteins 44 (2001) 150-165
16. Laman G. On graphs and rigidity of plane skeletal structures. J. Eng. Math. 4 (1970) 331-340
17. A. Lee, I. Streinu, L. Theran, Finding and maintaining rigid components, in: Proceedings of CCCG'05, Windsor, Canada, 2005.
18. Loréa M. On matroidal families. Discrete Math. 28 (1979) 103-106
19. Lovasz L., and Yemini Y. On generic rigidity in the plane. SIAM J. Algebraic Discrete Methods 3 1 (1982) 91-98
20. Nash-Williams C.S.A. Edge-disjoint spanning trees of finite graphs. J. London Math. Soc. 36 (1961) 445-450
21. Oxley J.G. Matroid Theory (1992), Oxford University Press, Oxford
22. Recski A. A network theory approach to the rigidity of skeletal structures I. Modelling and interconnection. Discrete Appl. Math. 7 (1984) 313-324
23. Roskind J., and Tarjan R.E. A note on finding minimum-cost edge-disjoint spanning trees. Math. Oper. Res. 10 4 (1985) 701-708
24. Szegö L. On constructive characterizations of (k, l)-sparse graphs, TR 2003-10, Eötvös (2003), University, Budapest, Hungary
25. Tarjan R.E. Edge-disjoint spanning trees and depth-first search. Acta Inform. 6 (1976) 171-185
26. Tay T.-S. Rigidity of multi-graphs I. Linking rigid bodies in n-space. J. Combin. Theory Ser. B 36 (1984) 95-112
27. Tay T.-S., and Whiteley W. Generating isostatic graphs. Structural Topology 11 (1985) 21-68
28. Tutte W.T. On the problem of decomposing a graph into n connected factors. J. London Math. Soc. 142 (1961) 221-230
29. Whiteley W. The union of matroids and the rigidity of frameworks. SIAM J. Discrete Math. 1 2 (1988) 237-255
30. Whiteley W. Some matroids from discrete applied geometry. In: Bonin J.O.J., and Servatius B. (Eds). Matroid Theory (1996), American Mathematical Society, Providence, RI 171-311