396 search results - page 5 / 80 » Exact Algorithms for Graph Homomorphisms |
132
Voted
WADS
2001
Springer
15 years 10 months ago
2001
Springer
153
Voted
KR
2004
Springer
15 years 11 months ago
2004
Springer
Simple Conceptual Graphs (SGs) are used to represent entities and relations between these entities: they can be translated into positive, conjunctive, existential first-order log...
156
Voted
WG
2009
Springer
16 years 12 days ago
2009
Springer
The Hamiltonian Cycle problem asks if an n-vertex graph G has a cycle passing through all vertices of G. This problem is a classic NP-complete problem. So far, finding an exact al...
165
click to vote
ICAPR
2005
Springer
15 years 11 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...
166
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm...