Thomason's algorithm for finding a second hamiltonian circuit through a given edge in a cubic graph is exponential on Krawczyk's graphs.
Kathie CameronPublished in: Discret. Math. (2001)
Keyphrases
- weighted graph
- graph structure
- learning algorithm
- graph construction
- graph search
- graph isomorphism
- undirected graph
- finding the shortest path
- minimum spanning tree
- graph model
- spanning tree
- adjacency graph
- graph theoretical
- edge weights
- bipartite graph
- hamiltonian cycle
- graph matching algorithm
- random graphs
- graph based algorithm
- vertex set
- maximum clique
- graph theoretic
- graph partitioning
- hyper graph
- np hard
- polynomial time complexity
- dominating set
- optimal solution
- clustering algorithm