vix.ing · top · new · best · stats

Polynomial time algorithms for Hamiltonian problems on bipartite distance-hereditary graphs

1993/07/01 by Haiko Müller, Falk Nicolai · 14 citations
Computer Science · Engineering · Mathematics · #Algorithm #Bipartite graph #Chordal graph #Coding theory and cryptography #Combinatorics #Complete bipartite graph #Discrete mathematics #Finite Group Theory Research #Graph #Hamiltonian (control theory) #Hamiltonian path #Hamiltonian path problem #Mathematical optimization #Mathematics #Neighbourhood (mathematics) #Vertex (graph theory) #graph theory and CDMA systems

paper · doi:10.1016/0020-0190(93)90100-n

published in Information Processing Letters 46(5), 225-230 (Elsevier BV)

crossref issued 1993/07/01 · crossref published 1993/07/01 · crossref published-print 1993/07/01 · openalex publication_date 1993/07/01 · crossref created 2002/07/25 · crossref deposited 2019/04/13 · crossref indexed 2025/03/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/23

Citations

Cited by