Sciweavers

Share
63 search results - page 1 / 13
» Lower bounds for graph embeddings and combinatorial precondi...
Sort
View
SPAA
2004
ACM
9 years 20 days ago
Lower bounds for graph embeddings and combinatorial preconditioners
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...
Gary L. Miller, Peter C. Richter
JGT
2006
73views more  JGT 2006»
8 years 7 months ago
Nearly light cycles in embedded graphs and crossing-critical graphs
We find a lower bound for the proportion of face boundaries of an embedded graph that are nearly
Mario Lomelí, Gelasio Salazar
APPML
2006
73views more  APPML 2006»
8 years 7 months ago
Threshold arrangements and the knapsack problem
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...
Günter Rote, André Schulz
COMGEO
2010
ACM
8 years 7 months ago
Mixed volume techniques for embeddings of Laman graphs
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...
Reinhard Steffens, Thorsten Theobald
books