Login / Signup
The Complexity of Counting Eulerian Tours in 4-Regular Graphs
Qi Ge
Daniel Stefankovic
Published in:
CoRR (2010)
Keyphrases
</>
computational cost
worst case
graph mining
image processing
similarity measure
graph structure
graph model
database
information retrieval
pairwise
np hard
weighted graph
space complexity
graph representation