Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
An improvement of Goldberg, Plotkin and Vaidya's maximal node-disjoint paths algorithm
Information Processing Letters
SIAM Journal on Computing
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Sublinear-time parallel algorithms for matching and related problems
Journal of Algorithms
On the effect of local changes in the variable ordering of ordered decision diagrams
Information Processing Letters
Augment or push: a computational study of bipartite matching and unit-capacity flow algorithms
Journal of Experimental Algorithmics (JEA)
Branching programs and binary decision diagrams: theory and applications
Branching programs and binary decision diagrams: theory and applications
Quality matching and local improvement for multilevel graph-partitioning
Parallel Computing - Special issue on graph partioning and parallel computing
A Symbolic Algorithms for Maximum Flow in 0-1 Networks
Formal Methods in System Design
Computing strongly connected components in a linear number of symbolic steps
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps
FMCAD '00 Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design
Complexity of Problems on Graphs Represented as OBDDs (Extended Abstract)
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Fast algorithms for finding matchings in lopsided bipartite graphs with applications to display ads
Proceedings of the 11th ACM conference on Electronic commerce
Exponential space complexity for OBDD-based reachability analysis
Information Processing Letters
Exponential space complexity for symbolic maximum flow algorithms in 0-1 networks
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
On symbolic OBDD-based algorithms for the minimum spanning tree problem
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
The complexity of problems on implicitly represented inputs
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Exponential lower bounds on the space complexity of OBDD-Based graph algorithms
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
An efficient implicit OBDD-Based algorithm for maximal matchings
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Priority functions for the approximation of the metric TSP
Information Processing Letters
| Hi-index | 0.00 |
The maximum bipartite matching problem, an important problem in combinatorial optimization, has been studied for a long time. In order to solve problems for very large structured graphs in reasonable time and space, implicit algorithms have been investigated. Any object to be manipulated is binary encoded and problems have to be solved mainly by functional operations on the corresponding Boolean functions. OBDDs are a popular data structure for Boolean functions, therefore, OBDD-based algorithms have been used as an heuristic approach to handle large input graphs. Here, two OBDD-based maximum bipartite matching algorithms are presented, which are the first ones using only a sublinear number of operations (with respect to the number of vertices of the input graph) for a problem unknown to be in NC, the complexity class that contains all problems computable in deterministic polylogarithmic time with polynomially many processors. Furthermore, the algorithms are experimentally evaluated.