On Symbolic Representations of Maximum Matchings and (Un)directed Graphs

DOI10.1007/978-3-642-15240-5_21zbMath1198.68180OpenAlexW1605401402MaRDI QIDQ3163890

Beate Bollig

Publication date: 27 October 2010

Published in: IFIP Advances in Information and Communication Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15240-5_21

zbMATH Keywords

computational complexityordered binary decision diagramslower boundsmaximum matchingsymbolic algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (5)

Implicit Computation of Maximum Bipartite Matchings by Sublinear Functional Operations ⋮ On symbolic OBDD-based algorithms for the minimum spanning tree problem ⋮ 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: On Symbolic Representations of Maximum Matchings and (Un)directed Graphs