Graded sparse graphs and matroids

Journal of Universal Computer Science

Volumn 13, Issue 11, 2007, Pages 1671-1679

  Lee, Audrey ^a   Streinu, Ileana ^b   Theran, Louis ^a  

^a UNIVERSITY OF MASSACHUSETTS   (United States)

^b SMITH COLLEGE   (United States)

Author keywords

Computational geometry; Hypergraph; Matroid; Pebble game; Rigidity theory

Indexed keywords

EID: 38749154677     PISSN: 0958695X     EISSN: 09486968     Source Type: Journal    
DOI: None     Document Type: Article

References (18)

1. Berg, A. R., Jordán, T.: "Algorithms for graph rigidity and scene analysis"; Proc. 11th ESA, LNCS volume 2832, Springer (2003), 78-89.
2. Haas, R.: "Characterizations of arboricity of graphs"; Ars Combinatorica 63 (2002), 129-137.
3. Haas, R., Lee, A., Streinu, I., Theran, L.: "Characterizing sparse graphs by map decompositions"; Journal of Combinatorial Mathematics and Combinatorial Computing, vol. 62, 3-11 (2007); http://arxiv.org/abs/0704.3843.
4. Hendrickson, B.: "Conditions for unique graph realizations"; SIAM Journal of Computing 21, 1 (1992), 65-84.
5. Jacobs, D. J., Hendrickson, B.: "An algorithm for two-dimensional rigidity percolation: the pebble game"; Journal of Computational Physics 137 (1992), 346-365.
6. Laman, G.: "On graphs and rigidity of plane skeletal structures"; Journal of Engineering Mathematics 4 (1970), 331-340.
7. Lee, A., Streinu, I.: "Pebble game algorithms and sparse graphs"; Discrete Mathematics, to appear; http://arxiv.org/abs/math/ 0702129.
8. Lee, A., Streinu, I., Theran, L.: "Finding and maintaining rigid components"; Proceedings of the 17th Canadian Conference on Computational Geometry, Windsor, Ontario (2005); http://cccg.cs.uwindsor.ca/papers/72.pdf.
9. Lee, A., Streinu, I., Theran, L.: "The slider-pinning problem"; Proceedings of the 19th Canadian Conference on Computational Geometry, Ottawa, Ontario (2007); http://linkage.cs.umass.edu/publications/sliders-cccg.pdf.
10. Nash-Williams, C. S. J. A.: "Edge-disjoint spanning trees of finite graphs"; Journal London Math. Soc. 36 (1961), 445-450.
11. Oxley, J. G.: "Matroid theory"; The Clarendon Press Oxford University Press, New York (1961).
12. Servatius, B., Whiteley, W.: "Constraining plane configurations in CAD: Combinatorics of directions and lengths"; SIAM Journal on Discrete Mathematics 12(1) (1999), 136-153.
13. Streinu, I., Theran, L.: "Sparse hypergraphs and pebble game algorithms" European Journal of Combinatorics, special issue for Oriented Matroids'05, to appear (2008); http://arxiv.org/abs/math/0703921.
14. Streinu, I., Theran, L.: "Combinatorial genericity and minimal rigidity"; Manuscript (2007); http://arxiv.org/abs/0712.0031.
15. Tay, T.-S.: "Rigidity of multigraphs I: linking rigid bodies in n-space"; Journal of Combinatorial Theory Series B 26 (1994), 95-112.
16. Tutte, W. T.: "On the problem of decomposing a graph into n connected factors"; Journal London Math. Soc. 142 (1961), 221-230.
17. Whiteley, W.: "The union of matroids and the rigidity of frameworks"; SIAM Journal Discrete Mathematics 1, 2 (1988), 237-255.
18. Whiteley, W.: "Some matroids from discrete applied geometry"; In: Matroid Theory (Bonin, J., Oxley, J. G., Servatius, B., Editors), volume 197 of Contemporary Mathematica, American Mathematical Society (1996), 171-311.