Implicit computation of maximum bipartite matchings by sublinear functional operations
DOI10.1016/J.TCS.2014.07.020zbMATH Open1303.68065OpenAlexW2176052300MaRDI QIDQ477185FDOQ477185
Authors: Beate Bollig, Marc Gillé, Tobias Pröger 
Publication date: 2 December 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.07.020
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Data structures (68P05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Network flows. Theory, algorithms, and applications.
- Graph-Based Algorithms for Boolean Function Manipulation
- Power balance and apportionment algorithms for the United States Congress
- Branching Programs and Binary Decision Diagrams
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- TWO THEOREMS IN GRAPH THEORY
- On the effect of local changes in the variable ordering of ordered decision diagrams
- Symbolic topological sorting with OBDDs
- Symbolic graphs: Linear solutions to connectivity related problems
- Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms
- Title not available (Why is that?)
- SOFSEM 2006: Theory and Practice of Computer Science
- SOFSEM 2004: Theory and Practice of Computer Science
- Exponential space complexity for OBDD-based reachability analysis
- On symbolic OBDD-based algorithms for the minimum spanning tree problem
- On symbolic representations of maximum matchings and (Un)directed graphs
- Exponential Space Complexity for Symbolic Maximum Flow Algorithms in 0-1 Networks
- An improvement of Goldberg, Plotkin and Vaidya's maximal node-disjoint paths algorithm
- Quality matching and local improvement for multilevel graph-partitioning
- Complexity and modeling aspects of mesh refinement into quadrilaterals
- New results on the most significant bit of integer multiplication
- An Efficient Implicit OBDD-Based Algorithm for Maximal Matchings
- Sublinear-Time Parallel Algorithms for Matching and Related Problems
- PARALLEL APPROXIMATE MATCHING
- Solving maximum flow problems on real-world bipartite graphs
Cited In (2)
This page was built for publication: Implicit computation of maximum bipartite matchings by sublinear functional operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477185)
