42 search results - page 9 / 9 » Small subgraphs of random regular graphs |
ESA
2004
Springer
13 years 11 months ago
2004
Springer
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all ...
DCG
2006
13 years 5 months ago
2006
Let A be a d by n matrix, d < n. Let C be the regular cross polytope (octahedron) in Rn . It has recently been shown that properties of the centrosymmetric polytope P = AC are ...