Implicit computation of maximum bipartite matchings by sublinear functional operations
type: Item
instance of: scholarly article
title: Implicit computation of maximum bipartite matchings by sublinear functional operations
zbMATH Open document ID: 1303.68065
author: Beate Bollig
author: Marc Gillé
author: Tobias Pröger
published in: Theoretical Computer Science
publication date: 2014-12-02T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6376181
zbMATH Keywords: implicit algorithms
zbMATH Keywords: maximum bipartite matchings
zbMATH Keywords: ordered binary decision diagrams
MaRDI profile type: Publication
full work available at URL: j.tcs.2014.07.020
OpenAlex ID: W2176052300
cites work: Q3056948
cites work: TWO THEOREMS IN GRAPH THEORY
cites work: Exponential space complexity for OBDD-based reachability analysis
cites work: Exponential Space Complexity for Symbolic Maximum Flow Algorithms in 0-1 Networks
cites work: On Symbolic OBDD-Based Algorithms for the Minimum Spanning Tree Problem
cites work: On Symbolic Representations of Maximum Matchings and (Un)directed Graphs
cites work: New results on the most significant bit of integer multiplication
cites work: On the effect of local changes in the variable ordering of ordered decision diagrams
cites work: An Efficient Implicit OBDD-Based Algorithm for Maximal Matchings
cites work: Graph-Based Algorithms for Boolean Function Manipulation
cites work: Power balance and apportionment algorithms for the United States Congress
cites work: Q4471346
cites work: Symbolic graphs: Linear solutions to connectivity related problems
cites work: Sublinear-Time Parallel Algorithms for Matching and Related Problems
cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
cites work: An improvement of Goldberg, Plotkin and Vaidya's maximal node-disjoint paths algorithm
cites work: Complexity and modeling aspects of mesh refinement into quadrilaterals
cites work: Quality matching and local improvement for multilevel graph-partitioning
cites work: Solving maximum flow problems on real-world bipartite graphs
cites work: SOFSEM 2004: Theory and Practice of Computer Science
cites work: Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms
cites work: SOFSEM 2006: Theory and Practice of Computer Science
cites work: PARALLEL APPROXIMATE MATCHING
cites work: Branching Programs and Binary Decision Diagrams
cites work: Symbolic topological sorting with OBDDs
DOI: 10.1016/J.TCS.2014.07.020
description: scientific article; zbMATH DE number 6376181