10608 search results - page 453 / 2122 » Complexity of O'Hara's Algorithm |
139
click to vote
KDD
2003
ACM
16 years 5 months ago
2003
ACM
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
240
click to vote
SIGMOD
2007
ACM
16 years 4 months ago
2007
ACM
The primary goal of data stream research is to develop space and time efficient solutions for answering continuous online summarization queries. Research efforts over the last dec...
131
click to vote
SIGMOD
2003
ACM
16 years 4 months ago
2003
ACM
We consider the problem of mapping data in peer-topeer data-sharing systems. Such systems often rely on the use of mapping tables listing pairs of corresponding values to search f...
145
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance width are known to be solvable in polynomial time [2],[19]. We give restricted spa...
142
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...