172 search results - page 10 / 35 » The Complexity of Unions of Disjoint Sets |
IANDC
2006
13 years 7 months ago
2006
We study several algebras of graphs and hypergraphs and the corresponding notions of equational sets and recognizable sets. We generalize and unify several existing results which ...
DASFAA
2008
IEEE
13 years 9 months ago
2008
IEEE
Recently, great efforts have been dedicated to researches on the management of large-scale graph-based data, where node disjoint subgraph homeomorphism relation between graphs has ...
ATMOS
2010
13 years 6 months ago
2010
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
PAMI
2007
13 years 7 months ago
2007
—A new parameter-free graph-morphology-based segmentation algorithm is proposed to address the problem of partitioning a 3D triangular mesh into disjoint submeshes that correspon...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
: Given two testable properties P1 and P2, under what conditions are the union, intersection or set-difference of these two properties also testable? We initiate a systematic study...