1097 search results - page 34 / 220 » Testing Graph Isomorphism |
CORR
2012
Springer
13 years 5 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...
JSC
2010
14 years 8 months ago
2010
We describe an algorithm for computing automorphism groups and testing isomorphisms of finite dimensional Lie algebras over finite fields. The algorithm is particularly effect...
ECCC
2000
14 years 9 months ago
2000
We consider testing graph expansion in the bounded-degree graph model. Specifically, we refer to algorithms for testing whether the graph has a second eigenvalue bounded above by a...
ICAPR
2005
Springer
15 years 3 months ago
2005
Springer
The RW algorithm has been proposed recently to solve the exact graph matching problem. This algorithm exploits Random Walk theory to compute a topological signature which can be u...
JCT
2007
14 years 9 months ago
2007
We show that to each graceful labelling of a path on 2s + 1 vertices, s ≥ 2, there corresponds a current assignment on a 3-valent graph which generates at least 22s cyclic orien...