352 search results - page 3 / 71 » Partitioning Graphs into Connected Parts |
CCCG
2007
14 years 11 months ago
2007
The empty space around n disjoint line segments in the plane can be partitioned into n + 1 convex faces by extending the segments in some order. The dual graph of such a partition...
COCOON
2006
Springer
14 years 11 months ago
2006
Springer
Assume that each vertex of a graph G is assigned a constant number q of nonnegative integer weights, and that q pairs of nonnegative integers li and ui, 1 i q, are given. One wis...
JCT
2000
14 years 9 months ago
2000
ARSCOM
2002
14 years 9 months ago
2002
A graphical partition of the even integer n is a partition of n where each part of the partition is the degree of a vertex in a simple graph and the degree sum of the graph is n. ...
AAAI
2007
14 years 11 months ago
2007
Existing graph partitioning approaches are mainly based on optimizing edge cuts and do not take the distribution of edge weights (link distribution) into consideration. In this pa...