An Efficient Implicit OBDD-Based Algorithm for Maximal Matchings

DOI10.1007/978-3-642-28332-1_13zbMath1351.68112OpenAlexW57301240MaRDI QIDQ2890187

Tobias Pröger, Beate Bollig

Publication date: 8 June 2012

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-28332-1_13

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Approximation methods and heuristics in mathematical programming (90C59) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)

Related Items (4)

Implicit Computation of Maximum Bipartite Matchings by Sublinear Functional Operations ⋮ Priority functions for the approximation of the metric TSP ⋮ On efficient implicit OBDD-based algorithms for maximal matchings ⋮ Implicit computation of maximum bipartite matchings by sublinear functional operations

This page was built for publication: An Efficient Implicit OBDD-Based Algorithm for Maximal Matchings