An efficient implicit OBDD-based algorithm for maximal matchings

DOI10.1007/978-3-642-28332-1_13MaRDI QIDQ2890187zbMATH OpenOpenAlexFDO

Authors Beate Bollig, Tobias Pröger

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

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

Recommendations

• On efficient implicit OBDD-based algorithms for maximal matchings
• Implicit computation of maximum bipartite matchings by sublinear functional operations
• Implicit computation of maximum bipartite matchings by sublinear functional operations
• Randomized OBDD-based graph algorithms
• Randomized OBDD-based graph algorithms

Cited in

(8)

• Randomized OBDD-based graph algorithms
• Priority functions for the approximation of the metric TSP
• Implicit computation of maximum bipartite matchings by sublinear functional operations
• scientific article; zbMATH DE number 5909229 (Why is no real title available?)
• On symbolic representations of maximum matchings and (Un)directed graphs
• Randomized OBDD-based graph algorithms
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2890187)