scientific article

zbMath1192.05096MaRDI QIDQ3576685

Audrey Lee, Ileana Streinu

Publication date: 30 July 2010

Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAE0136/0.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

rigidityarboricitysparse graphpebble gamegraph orientation with bounded degree

Mathematics Subject Classification ID

Games involving graphs (91A43) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Games on graphs (graph-theoretic aspects) (05C57)

Related Items

Enumerating non-crossing minimally rigid frameworks ⋮ Augmenting the rigidity of a graph in \(\mathbb R^{2}\) ⋮ Enumerating constrained non-crossing minimally rigid frameworks ⋮ Combinatorial characterization of the Assur graphs from engineering

This page was built for publication: