An algebraic matching algorithm
From MaRDI portal
Publication:1586334
DOI10.1007/s004930070031zbMath0949.05062OpenAlexW1989949821MaRDI QIDQ1586334
Publication date: 13 November 2000
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004930070031
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (7)
Combinatorial algorithms for matchings, even factors and square-free 2-factors ⋮ Non-commutative Edmonds' problem and matrix semi-invariants ⋮ On the Expressive Power of Read-Once Determinants ⋮ Greedy matching: guarantees and limitations ⋮ Finding a shortest non-zero path in group-labeled graphs via permanent computation ⋮ Spanning trees of 3-uniform hypergraphs ⋮ Maximum rank matrix completion
This page was built for publication: An algebraic matching algorithm
