Some simplified NP-complete problems
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs
Discrete Applied Mathematics
Solving the path cover problem on circular-arc graphs by using an approximation algorithm
Discrete Applied Mathematics
Finding maximum square-free 2-matchings in bipartite graphs
Journal of Combinatorial Theory Series B
Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs
Theoretical Computer Science
Discrete Applied Mathematics
Solving the path cover problem on circular-arc graphs by using an approximation algorithm
Discrete Applied Mathematics
Hardness and approximation of minimum distortion embeddings
Information Processing Letters
| Hi-index | 0.02 |
Checking for Hamiltonian circuit in bipartite graphs is shown to be NP-hard.