Sciweavers

1664 search results - page 21 / 333
» Distance labeling in graphs
Sort
View
ICDE
2006
IEEE
177views Database» more  ICDE 2006»
16 years 1 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
CORR
2008
Springer
112views Education» more  CORR 2008»
14 years 12 months ago
Compact Labelings For Efficient First-Order Model-Checking
We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for check...
Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha...
ESA
2007
Springer
188views Algorithms» more  ESA 2007»
15 years 6 months ago
Fast and Compact Oracles for Approximate Distances in Planar Graphs
We present an experimental evaluation of an approximate distance oracle recently suggested by Thorup [1] for undirected planar graphs. The oracle uses the existence of graph separa...
Laurent Flindt Muller, Martin Zachariasen
ENTCS
2002
72views more  ENTCS 2002»
14 years 11 months ago
The synchronized graphs trace the context-sensitive languages
Morvan and Stirling have proved that the context-sensitive languages are exactly the traces of graphs defined by transducers with labelled final states. We prove that this result ...
Chloe Rispal
ECCV
2010
Springer
15 years 4 months ago
Semantic Label Sharing for Learning with Many Categories
In an object recognition scenario with tens of thousands of categories, even a small number of labels per category leads to a very large number of total labels required. We propose...