1729 search results - page 281 / 346 » Bound Graph Polysemy |
148
Voted
FOCS
2003
IEEE
15 years 10 months ago
2003
IEEE
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...
147
Voted
GBRPR
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. We present a new method (MIDES) to determine contraction kernels for the construction of graph pyramids. Experimentally the new method has a reduction factor higher than ...
136
Voted
FUN
2010
Springer
15 years 9 months ago
2010
Springer
We consider a class of highly dynamic networks modelled on an urban subway system. We examine the problem of creating a map of such a subway in less than ideal conditions, where th...
139
click to vote
GD
2009
Springer
15 years 9 months ago
2009
Springer
A graph G is a support for a hypergraph H = (V, S) if the vertices of G correspond to the vertices of H such that for each hyperedge Si ∈ S the subgraph of G induced by Si is co...
138
Voted
STOC
1992
ACM
15 years 9 months ago
1992
ACM
How much can an imperfect source of randomness affect an algorithm? We examine several simple questions of this type concerning the long-term behavior of a random walk on a finite...