Pebble Game Algorithms and (k,l)-Sparse Graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2005

Pebble Game Algorithms and (k,l)-Sparse Graphs

Abstract

A multi-graph $G$ on n vertices is $(k,l)$-sparse if every subset of $n'≤n$ vertices spans at most $kn'-l$ edges, $0 ≤l < 2k$. $G$ is tight if, in addition, it has exactly $kn - l$ edges. We characterize $(k,l)$-sparse graphs via a family of simple, elegant and efficient algorithms called the $(k,l)$-pebble games. As applications, we use the pebble games for computing components (maximal tight subgraphs) in sparse graphs, to obtain inductive (Henneberg) constructions, and, when $l=k$, edge-disjoint tree decompositions.
Fichier principal
Vignette du fichier
dmAE0136.pdf (185.72 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01184350 , version 1 (14-08-2015)

Identifiers

Cite

Audrey Lee, Ileana Streinu. Pebble Game Algorithms and (k,l)-Sparse Graphs. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. pp.181-186, ⟨10.46298/dmtcs.3394⟩. ⟨hal-01184350⟩

Collections

INSMI TDS-MACS
155 View
775 Download

Altmetric

Share

Gmail Facebook X LinkedIn More