scholarly journals Pebble game algorithms and sparse graphs

2008 ◽  
Vol 308 (8) ◽  
pp. 1425-1437 ◽  
Author(s):  
Audrey Lee ◽  
Ileana Streinu
Keyword(s):  
Sparse Graphs ◽  
Pebble Game

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

2005 ◽  
Vol DMTCS Proceedings vol. AE,... (Proceedings) ◽  
Author(s):  
Audrey Lee ◽  
Ileana Streinu
Keyword(s):  
Efficient Algorithms ◽  
Sparse Graphs ◽  
Edge Disjoint ◽  
International Audience ◽  
Tree Decompositions ◽  
Pebble Game

International audience 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.

Differentiable Functions Have Sparse Graphs

1978 ◽  
Vol 4 (1) ◽  
pp. 91
Author(s):  
Laczkovich ◽  
Petruska
Keyword(s):  
Sparse Graphs ◽  
Differentiable Functions

scholarly journals Solving statistical mechanics on sparse graphs with feedback-set variational autoregressive networks

2021 ◽  
Vol 103 (1) ◽  
Author(s):  
Feng Pan ◽  
Pengfei Zhou ◽  
Hai-Jun Zhou ◽  
Pan Zhang
Keyword(s):  
Statistical Mechanics ◽  
Sparse Graphs ◽  
Feedback Set

scholarly journals Decomposition of sparse graphs, with application to game coloring number

2010 ◽  
Vol 310 (10-11) ◽  
pp. 1520-1523 ◽  
Author(s):  
Mickael Montassier ◽  
Arnaud Pêcher ◽  
André Raspaud ◽  
Douglas B. West ◽  
Xuding Zhu
Keyword(s):  
Sparse Graphs ◽  
Coloring Number ◽  
Game Coloring Number

scholarly journals Characterization and recognition of P4-sparse graphs partitionable into k independent sets and ℓ cliques

2011 ◽  
Vol 159 (4) ◽  
pp. 165-173 ◽  
Author(s):  
Raquel S.F. Bravo ◽  
Sulamita Klein ◽  
Loana Tito Nogueira ◽  
Fábio Protti
Keyword(s):  
Independent Sets ◽  
Sparse Graphs

scholarly journals Spanners in sparse graphs

2011 ◽  
Vol 77 (6) ◽  
pp. 1108-1119 ◽  
Author(s):  
Feodor F. Dragan ◽  
Fedor V. Fomin ◽  
Petr A. Golovach
Keyword(s):  
Sparse Graphs

scholarly journals Efficient enumeration of dominating sets for sparse graphs

2021 ◽  
Author(s):  
Kazuhiro Kurita ◽  
Kunihiro Wasa ◽  
Hiroki Arimura ◽  
Takeaki Uno
Keyword(s):  
Dominating Sets ◽  
Sparse Graphs
Sign in / Sign up

Export Citation Format

Share Document