The Edge Hamiltonian Path Problem is NP-Complete for Bipartite Graphs.
Ten-Hwang LaiShu-Shang WeiPublished in: Inf. Process. Lett. (1993)
Keyphrases
- bipartite graph
- np complete
- hamiltonian path
- edge weights
- graph theoretic
- maximum matching
- randomly generated
- np hard
- computational complexity
- minimum weight
- graph clustering
- maximum cardinality
- satisfiability problem
- constraint satisfaction problems
- link prediction
- polynomial time complexity
- weighted graph
- edge detection
- bipartite networks
- mutual reinforcement
- bipartite graph matching
- data sets
- branch and bound algorithm
- social network analysis
- special case
- lower bound