61 search results - page 1 / 13 » Lower bounds for graph embeddings and combinatorial precondi... |
SPAA
2004
ACM
14 years 4 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
JGT
2006
13 years 10 months ago
2006
We find a lower bound for the proportion of face boundaries of an embedded graph that are nearly
ESA
2004
Springer
14 years 4 months ago
2004
Springer
APPML
2006
13 years 11 months ago
2006
We show that a combinatorial question which has been studied in connection with lower bounds for the knapsack problem by Brimkov and Dantchev (2001) is related to threshold graphs...
COMGEO
2010
ACM
13 years 11 months ago
2010
ACM
We use Bernstein's Theorem [1] to obtain combinatorial bounds for the number of embeddings of Laman graph frameworks modulo rigid motions. For this, we study the mixed volume...