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

Qi Ge Daniel Stefankovic

Published in: LATIN (2010)

Keyphrases

computational complexity
data sets
similarity measure
series parallel
graph theoretic
graph representation
graph theory
space complexity
polynomial time complexity
real time
vehicle routing
weighted graph
directed graph
worst case
computational cost
lower bound
neural network