Pebble Game Algorithms and Sparse Graphs
| dc.creator | Lee, Audrey | |
| dc.creator | Streinu, Ileana | |
| dc.date | 2007-02-06 | |
| dc.date.accessioned | 2026-07-07T07:45:41Z | |
| dc.date.available | 2026-07-07T07:45:41Z | |
| dc.description | A multi-graph $G$ on $n$ vertices is $(k,\ell)$-sparse if every subset of $n'\leq n$ vertices spans at most $kn'- \ell$ edges. $G$ is {\em tight} if, in addition, it has exactly $kn - \ell$ edges. For integer values $k$ and $\ell \in [0, 2k)$, we characterize the $(k,\ell)$-sparse graphs via a family of simple, elegant and efficient algorithms called the $(k,\ell)$-pebble games. | |
| dc.description | 20 pages, abstract presented at EuroComb '05 | |
| dc.identifier | https://arxiv.org/abs/math/0702129 | |
| dc.identifier | http://arxiv.org/abs/math/0702129 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/123615 | |
| dc.subject | Combinatorics | |
| dc.subject | Computational Geometry | |
| dc.subject | 52C25;68R10;05C85 | |
| dc.title | Pebble Game Algorithms and Sparse Graphs | |
| dc.type | text |