Pebble game algorithms and sparse graphs

120Citations
Citations of this article
37Readers
Mendeley users who have this article in their library.

Abstract

A multi-graph G on n vertices is (k, ℓ)-sparse if every subset of n′ ≤ n vertices spans at most kn′ - ℓ edges. G is tight if, in addition, it has exactly kn - ℓ edges. For integer values k and ℓ ∈ [0, 2 k), we characterize the (k, ℓ)-sparse graphs via a family of simple, elegant and efficient algorithms called the (k, ℓ)-pebble games. © 2007 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Lee, A., & Streinu, I. (2008). Pebble game algorithms and sparse graphs. Discrete Mathematics, 308(8), 1425–1437. https://doi.org/10.1016/j.disc.2007.07.104

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free