1991/02/01 by Hans Wilhelm Alt, H. Alt, N. Blum +5 · 1 citation
Computer Science · Mathematics · #3-dimensional matching #Adjacency matrix #Advanced Graph Theory Research #Bipartite graph #Cardinality (data modeling) #Combinatorics #Complete bipartite graph #Complexity and Algorithms in Graphs #Computational Geometry and Mesh Generation #Computer science #Discrete mathematics #Edge-transitive graph #Factor-critical graph #Graph #Graph power #Hopcroft–Karp algorithm #Line graph #Matching (statistics) #Mathematics #Pathwidth
paper · doi:10.1016/0020-0190(91)90195-n
crossref issued 1991/02/01 · crossref published 1991/02/01 · crossref published-print 1991/02/01 · openalex publication_date 1991/02/01 · crossref created 2002/07/25 · crossref deposited 2019/04/13 · openalex created_date 2025/10/10 · crossref indexed 2026/07/10 · openalex updated_date 2026/07/23