Login / Signup
The Complexity of Finding a Second Hmiltonian Cycle in Cubic Graphs.
Adam Krawczyk
Published in:
J. Comput. Syst. Sci. (1999)
Keyphrases
</>
computational complexity
data structure
decision problems
graph theoretic
database
neural network
bayesian networks
graph theory
undirected graph
graph representation
bounded treewidth
representational power