2487 search results - page 144 / 498 » Partitions of Graphs into Trees |
132
Voted
IJFCS
2007
15 years 3 months ago
2007
The longest path problem is to find a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigat...
151
click to vote
CVPR
2005
IEEE
16 years 5 months ago
2005
IEEE
We present a multiscale spectral image segmentation algorithm. In contrast to most multiscale image processing, this algorithm works on multiple scales of the image in parallel, w...
108
click to vote
WG
2009
Springer
15 years 10 months ago
2009
Springer
In this paper, we study the sub-coloring and hypo-coloring problems on interval graphs. These problems have applications in job scheduling and distributed computing and can be used...
236
Voted
ICDE
2006
IEEE
16 years 4 months ago
2006
IEEE
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
121
Voted
SIGMOD
2004
ACM
16 years 3 months ago
2004
ACM
Trees and graphs are widely used to model biological databases. Providing efficient algorithms to support tree-based or graph-based querying is therefore an important issue. In th...