1952 search results - page 109 / 391 » Complete partitions of graphs |
163
click to vote
RIVF
2003
15 years 5 months ago
2003
—In this paper we consider the Airspace Sectorization Problem (ASP) where airspace has to be partitioned into a number of sectors, each sector being assigned to a team of air tra...
137
click to vote
ENDM
2008
15 years 4 months ago
2008
A graph G is clique-perfect if the cardinality of a maximum clique-independent set of H equals the cardinality of a minimum clique-transversal of H, for every induced subgraph H o...
178
click to vote
MVA
2008
15 years 4 months ago
2008
This paper presents a new graph cut-based multiple active contour algorithm to detect optimal boundaries and regions in images without initial contours and seed points. The task of...
164
click to vote
ICDE
2010
IEEE
15 years 9 months ago
2010
IEEE
— Finding decompositions of a graph into a family of clusters is crucial to understanding its underlying structure. While most existing approaches focus on partitioning the nodes...
150
click to vote
CPC
2004
15 years 4 months ago
2004
The strong chromatic number, S(G), of an n-vertex graph G is the smallest number k such that after adding kn/k-n isolated vertices to G and considering any partition of the vertic...