321 search results - page 6 / 65 » Partitioning by iterative deletion |
56
Voted
AAAI
2008
15 years 2 months ago
2008
70
Voted
TODAES
2002
15 years 6 days ago
2002
78
Voted
TECS
2010
14 years 11 months ago
2010
113
Voted
COCOON
2006
Springer
15 years 2 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...
99
Voted
JGT
2006
15 years 16 days ago
2006
Abstract: A k-tree is a chordal graph with no (k + 2)-clique. An -treepartition of a graph G is a vertex partition of G into `bags,' such that contracting each bag to a single...