823 search results - page 12 / 165 » Brick partitions of graphs |
145
click to vote
COCOON
2008
Springer
15 years 7 months ago
2008
Springer
Given a class of graphs, G, a graph G is a probe graph of G if its vertices can be partitioned into two sets, P (the probes) and N (the nonprobes), where N is an independent set, s...
144
click to vote
PC
2000
15 years 5 months ago
2000
Three parallel optimisation algorithms for use in the context of multilevel graph partitioning for unstructured meshes are described. The first, interface optimisation reduces the...
158
click to vote
COMBINATORICA
2006
15 years 6 months ago
2006
In this paper we show that, if G is a Berge graph such that neither G nor its complement G contains certain induced subgraphs, named proper wheels and long prisms, then either G i...
157
click to vote
MASCOTS
2003
15 years 7 months ago
2003
Scalability is the primary challenge to studying large complex network systems with network emulation. This paper studies topology partitioning, assigning disjoint pieces of the n...
179
click to vote
GC
2011
Springer
14 years 9 months ago
2011
Springer
The minimum clique partition (MCP) problem is that of partitioning the vertex set of a given graph into a minimum number of cliques. Given n points in the plane, the corresponding...