arXiv · math/0702129
Pebble Game Algorithms and Sparse Graphs
Abstract
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Audrey Lee, Ileana Streinu. 2007-02-06. Pebble Game Algorithms and Sparse Graphs. https://searcharxiv.com/abs/math/0702129
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.