Sciweavers

9532 search results - page 321 / 1907
» Logic, Graphs, and Algorithms
Sort
View
DASFAA
2009
IEEE
173views Database» more  DASFAA 2009»
15 years 10 months ago
A Uniform Framework for Ad-Hoc Indexes to Answer Reachability Queries on Large Graphs
Graph-structured databases and related problems such as reachability query processing have been increasingly relevant to many applications such as XML databases, biological databas...
Linhong Zhu, Byron Choi, Bingsheng He, Jeffrey Xu ...
DAM
2010
167views more  DAM 2010»
15 years 6 months ago
A new characterization of P6-free graphs
We study P6-free graphs, i.e., graphs that do not contain an induced path on six vertices. Our main result is a new characterization of this graph class: a graph G is P6-free if an...
Pim van 't Hof, Daniël Paulusma
CORR
2006
Springer
90views Education» more  CORR 2006»
15 years 6 months ago
The recognizability of sets of graphs is a robust property
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the noti...
Bruno Courcelle, Pascal Weil
182
Voted
CORR
2007
Springer
104views Education» more  CORR 2007»
15 years 6 months ago
Observable Graphs
An edge-colored directed graph is observable if an agent that moves along its edges is able to determine his position in the graph after a sufficiently long observation of the edge...
Raphael M. Jungers, Vincent D. Blondel
ISCI
2007
170views more  ISCI 2007»
15 years 6 months ago
Automatic learning of cost functions for graph edit distance
Graph matching and graph edit distance have become important tools in structural pattern recognition. The graph edit distance concept allows us to measure the structural similarit...
Michel Neuhaus, Horst Bunke