2270 search results - page 83 / 454 » On the distribution of eigenvalues of graphs |
208
click to vote
PODC
2011
ACM
14 years 9 months ago
2011
ACM
This work studies decision problems from the perspective of nondeterministic distributed algorithms. For a yes-instance there must exist a proof that can be verified with a distri...
175
click to vote
STACS
2007
Springer
16 years 9 days ago
2007
Springer
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized b...
176
click to vote
ISCI
2007
15 years 6 months ago
2007
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...
177
click to vote
IWOCA
2010
Springer
15 years 1 months ago
2010
Springer
A homomorphism from a graph G to a graph R is locally surjective if its restriction to the neighborhood of each vertex of G is surjective. Such a homomorphism is also called an R-r...
184
click to vote
CORR
2012
Springer
14 years 1 months ago
2012
Springer
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been consid...