The Complexity of Counting Eulerian Tours in 4-regular Graphs.

Qi Ge Daniel Stefankovic

Published in: Algorithmica (2012)

Keyphrases

image processing
computational complexity
graph matching
graph theory
information systems
web pages
computational cost
worst case
graph mining
spanning tree
complexity analysis
vehicle routing
representational power
polynomial time complexity