1402 search results - page 204 / 281 » Sparse-Memory Graph Search |
110
Voted
SODA
2008
ACM
15 years 4 months ago
2008
ACM
In recent years there has been considerable interest in analyzing random graph models for the Web. We consider two such models - the Random Surfer model, introduced by Blum et al....
93
Voted
AIPS
2000
15 years 3 months ago
2000
We will discuss the shortcomings of known variable and value ordering strategies for Graphplan's backward search phase, and propose a novel strategy that is based on a notion...
IPL
2006
15 years 2 months ago
2006
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is the k...
128
Voted
ARSCOM
2004
15 years 2 months ago
2004
All cubic partial cubes (i.e., cubic isometric subgraphs of hypercubes) up to 30 vertices and all edge-critical partial cubes up to 14 vertices are presented. The lists of graphs ...
118
click to vote
DLOG
2007
15 years 4 months ago
2007
We show that global caching can be used with propagation of both satisfiability and unsatisfiability in a sound manner to give an EXPTIME algorithm for checking satisfiability w...