1952 search results - page 117 / 391 » Complete partitions of graphs |
143
click to vote
DM
1999
15 years 4 months ago
1999
We examine powers of Hamiltonian paths and cycles as well as Hamiltonian (power) completion problems in several highly structured graph classes. For threshold graphs we give effic...
157
click to vote
SODA
2008
ACM
15 years 5 months ago
2008
ACM
New tight bounds are presented on the minimum length of planar straight line graphs connecting n given points in the plane and having convex faces. Specifically, we show that the ...
120
click to vote
SAMT
2007
Springer
15 years 10 months ago
2007
Springer
This paper proposes a new stopping criterion for automatic image segmentation based on region merging. The criterion is dependent on image content itself and when combined with the...
161
click to vote
IPPS
2010
IEEE
15 years 1 months ago
2010
IEEE
We present a novel architecture of a communication engine for non-coherent distributed shared memory systems. The shared memory is composed by a set of nodes exporting their memory...
154
click to vote
LICS
2005
IEEE
15 years 10 months ago
2005
IEEE
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...