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.
Type de document :
Communication dans un congrès
Stefan Felsner. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), pp.181-186, 2005, DMTCS Proceedings
Liste complète des métadonnées

Littérature citée [18 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01184350
Contributeur : Coordination Episciences Iam <>
Soumis le : vendredi 14 août 2015 - 11:36:47
Dernière modification le : jeudi 11 mai 2017 - 01:02:54
Document(s) archivé(s) le : dimanche 15 novembre 2015 - 10:58:00

Fichier

dmAE0136.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

  • HAL Id : hal-01184350, version 1

Collections

Citation

Audrey Lee, Ileana Streinu. Pebble Game Algorithms and (k,l)-Sparse Graphs. Stefan Felsner. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), pp.181-186, 2005, DMTCS Proceedings. 〈hal-01184350〉

Partager

Métriques

Consultations de la notice

46

Téléchargements de fichiers

99