1027 search results - page 9 / 206 » Ordered Vertex Partitioning |
NETWORKS
2007
13 years 7 months ago
2007
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...
FPGA
1995
ACM
13 years 11 months ago
1995
ACM
One of the critical issues for multi-FPGA systems is developing software tools for automatically mapping circuits. In this paper we consider one step in this process, partitioning...
JCO
2007
13 years 7 months ago
2007
A graph G is said to be m-sufficient if m is not exceeding the order of G, each vertex of G is of even degree, and the number of edges in G is a multiple of m. A complete multipar...
DAM
2006
13 years 7 months ago
2006
The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neigh...
21
Voted
GC
2011
Springer
12 years 11 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...