Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs
From MaRDI portal
Publication:6487434
DOI10.1007/bfb0009490zbMath1516.05207MaRDI QIDQ6487434
Publication date: 25 January 2023
Extremal problems in graph theory (05C35) Combinatorics of partially ordered sets (06A07) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (1)
This page was built for publication: Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs