Sciweavers

1221 search results - page 100 / 245
» Balanced graph partitioning
Sort
View
JGAA
2008
100views more  JGAA 2008»
13 years 10 months ago
Parameters of Bar k-Visibility Graphs
Bar k-visibility graphs are graphs admitting a representation in which the vertices correspond to horizontal line segments, called bars, and the edges correspond to vertical lines...
Stefan Felsner, Mareike Massow
ICDE
2004
IEEE
90views Database» more  ICDE 2004»
14 years 11 months ago
Multiresolution Indexing of XML for Frequent Queries
XML and other types of semi-structured data are typically represented by a labeled directed graph. To speed up path expression queries over the graph, a variety of structural inde...
Hao He, Jun Yang 0001
CVPR
2005
IEEE
15 years 2 days ago
Spectral Segmentation with Multiscale Graph Decomposition
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...
Florence Bénézit, Jianbo Shi, Timoth...
WG
2009
Springer
14 years 4 months ago
Sub-coloring and Hypo-coloring Interval Graphs
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...
Rajiv Gandhi, Bradford Greening, Sriram V. Pemmara...
ICDE
2006
IEEE
177views Database» more  ICDE 2006»
14 years 11 months ago
Searching Substructures with Superimposed Distance
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
Xifeng Yan, Feida Zhu, Jiawei Han, Philip S. Yu