3105 search results - page 15 / 621 » The Path-Packing Structure of Graphs |
AAAI
2007
15 years 4 days ago
2007
We describe a novel approach to parallelizing graph search using structured duplicate detection. Structured duplicate detection was originally developed as an approach to external...
ALGORITHMICA
2010
14 years 10 months ago
2010
We study the merging process when Kruskal's algorithm is run with random graphs as inputs. Our aim is to analyze this process when the underlying graph is the complete graph ...
SOCIALCOM
2010
14 years 7 months ago
2010
We introduce a novel technique for comparing graphs using the structure of their subgraphs, which we call a graph's fine structure. Our technique compares graphs using the ear...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We consider random walks on two classes of random graphs and explore the likely structure of the vacant set viz. the set of unvisited vertices. Let (t) be the subgraph induced by ...
AAAI
2004
14 years 11 months ago
2004
We consider how to use external memory, such as disk storage, to improve the scalability of heuristic search in statespace graphs. To limit the number of slow disk I/O operations,...