Implicit Computation of Maximum Bipartite Matchings by Sublinear Functional Operations (Q2898059): Difference between revisions

@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+TWO THEOREMS IN GRAPH THEORY
@@ Property / cites work: TWO THEOREMS IN GRAPH THEORY / rank @@
+Normal rank
@@ Property / cites work @@
+Exponential space complexity for OBDD-based reachability analysis
+Normal rank
@@ Property / cites work @@
+Exponential Space Complexity for Symbolic Maximum Flow Algorithms in 0-1 Networks
+Normal rank
@@ Property / cites work @@
+On Symbolic OBDD-Based Algorithms for the Minimum Spanning Tree Problem
+Normal rank
@@ Property / cites work @@
+On Symbolic Representations of Maximum Matchings and (Un)directed Graphs
+Normal rank
@@ Property / cites work @@
+On the effect of local changes in the variable ordering of ordered decision diagrams
+Normal rank
@@ Property / cites work @@
+An Efficient Implicit OBDD-Based Algorithm for Maximal Matchings
+Normal rank
@@ Property / cites work @@
+Graph-Based Algorithms for Boolean Function Manipulation
+Normal rank
@@ Property / cites work @@
+Power balance and apportionment algorithms for the United States Congress
+Normal rank
@@ Property / cites work @@
+Q4471346
@@ Property / cites work: Q4471346 / rank @@
+Normal rank
@@ Property / cites work @@
+Symbolic graphs: Linear solutions to connectivity related problems
+Normal rank
@@ Property / cites work @@
+Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems
+Normal rank
@@ Property / cites work @@
+Sublinear-Time Parallel Algorithms for Matching and Related Problems
+Normal rank
@@ Property / cites work @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+An improvement of Goldberg, Plotkin and Vaidya's maximal node-disjoint paths algorithm
+Normal rank
@@ Property / cites work @@
+Quality matching and local improvement for multilevel graph-partitioning
+Normal rank
@@ Property / cites work @@
+Complexity and modeling aspects of mesh refinement into quadrilaterals
+Normal rank
@@ Property / cites work @@
+Solving Maximum Flow Problems on Real World Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+SOFSEM 2004: Theory and Practice of Computer Science
+Normal rank
@@ Property / cites work @@
+Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms
+Normal rank
@@ Property / cites work @@
+SOFSEM 2006: Theory and Practice of Computer Science
+Normal rank
@@ Property / cites work @@
+PARALLEL APPROXIMATE MATCHING
@@ Property / cites work: PARALLEL APPROXIMATE MATCHING / rank @@
+Normal rank
@@ Property / cites work @@
+Branching Programs and Binary Decision Diagrams
@@ Property / cites work: Branching Programs and Binary Decision Diagrams / rank @@
+Normal rank
@@ Property / cites work @@
+Symbolic topological sorting with OBDDs
@@ Property / cites work: Symbolic topological sorting with OBDDs / rank @@
+Normal rank