828 search results - page 7 / 166 » Simplicial Powers of Graphs |
ALGORITHMICA
2006
13 years 7 months ago
2006
The k-Leaf Power recognition problem is a particular case of graph power problems: For a given graph it asks whether there exists an unrooted tree--the k-leaf root--with leaves on...
FOCS
2007
IEEE
13 years 11 months ago
2007
IEEE
We study the reconstruction of a stratified space from a possibly noisy point sample. Specifically, we use the vineyard of the distance function restricted to a 1-parameter family...
COMPGEOM
2011
ACM
12 years 11 months ago
2011
ACM
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
COCOON
2007
Springer
14 years 1 months ago
2007
Springer
Our motivation for this work is the remarkable discovery that many large-scale real-world graphs ranging from Internet and World Wide Web to social and biological networks exhibit ...
SODA
2000
ACM
13 years 8 months ago
2000
ACM
We give nontrivial bounds for the inductiveness or degeneracy of power graphs Gk of a planar graph G. This implies bounds for the chromatic number as well, since the inductiveness ...