653 search results - page 8 / 131 » The size of minimum 3-trees |
CORR
2010
Springer
14 years 4 months ago
2010
Springer
For p 1, we prove that every forest with p trees whose sizes are a1, . . . , ap can be embedded in any graph containing at least p i=1(ai + 1) vertices and having minimum degree ...
GLVLSI
2003
IEEE
15 years 2 months ago
2003
IEEE
Repeaters are often used to drive high impedance interconnects. These lines have become highly inductive and can affect signal behavior. The line inductance should therefore be co...
WG
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wish to partition G into connected components...
JDA
2006
14 years 9 months ago
2006
Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wishes to partition G into connected components by del...
DM
2002
14 years 9 months ago
2002
A star forest of a graph G is a spanning subgraph of G in which each component is a star. The minimum number of edges required to guarantee that an arbitrary graph, or a bipartite...