Treffer: The Edge Hamiltonian Path Problem is NP-complete for bipartite graphs
Title:
The Edge Hamiltonian Path Problem is NP-complete for bipartite graphs
Authors:
Source:
Information processing letters. 46(1):21-26
Publisher Information:
Amsterdam: Elsevier Science, 1993.
Publication Year:
1993
Physical Description:
print, 6 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Recherche information. Graphe, Information retrieval. Graph, Arête graphe, Edge(graph), Arista gráfico, Chemin hamiltonien, Hamiltonian path, Camino hamiltoniano, Complexité calcul, Computing complexity, Complejidad cálculo, Graphe biparti, Bipartite graph, Grafo bipartido, Problème NP complet, NP complete problem, Problema NP completo, Théorie graphe, Graph theory, Teoría grafo
Document Type:
Fachzeitschrift
Article
File Description:
text
Language:
English
Author Affiliations:
Ohio state univ., dep. computer information sci., Columbus OH 43210-1277, United States
ISSN:
0020-0190
Rights:
Copyright 1993 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.4810400
Database:
PASCAL Archive
Weitere Informationen
The Edge Hamiltonian Path Problem for general graphs was shown by Bertossi to be NP-complete. In some applications of the problem the input graph is typically bipartite. We show that the problem remains NP-complete even if restricted to bipartite graphs.