Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Introduction to algorithms
Handbook of theoretical computer science (vol. A)
Efficient implementation of a BDD package
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Re-encoding sequential circuits to reduce power dissipation
ICCAD '94 Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design
Handbook of Theoretical Computer Science
Handbook of Theoretical Computer Science
Graph Algorithms
Algebric Decision Diagrams and Their Applications
Formal Methods in System Design
Implicit Manipulation of Equivalence Classes Using Binary Decision Diagrams
ICCD '91 Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors
Redundancy Identification and Removal Based on Implicit State Enumeration
ICCD '91 Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors
Fast Sequential ATPG Based on Implicit State Enumeration
Proceedings of the IEEE International Test Conference on Test: Faster, Better, Sooner
Dos and don'ts of CTL state coverage estimation
Proceedings of the 40th annual Design Automation Conference
BDDs: design, analysis, complexity, and applications
Discrete Applied Mathematics - Optimal discrete structure and algorithms (ODSA 2000)
Lower bounds on the OBDD size of two fundamental functions' graphs
Information Processing Letters
Symbolic OBDD representations for mechanical assembly sequences
Computer-Aided Design
The symbolic OBDD scheme for generating mechanical assembly sequences
Formal Methods in System Design
Representation of graphs by OBDDs
Discrete Applied Mathematics
Symbolic OBDD-Based Reachability Analysis Needs Exponential Space
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
BDDs-design, analysis, complexity, and applications
Discrete Applied Mathematics
K-Tree: A multiple tree video multicast protocol for Ad hoc wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
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
A larger lower bound on the OBDD complexity of the most significant bit of multiplication
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Representation of graphs by OBDDs
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Lower bounds on the OBDD size of graphs of some popular functions
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
On symbolic scheduling independent tasks with restricted execution times
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
A symbolic approach to the all-pairs shortest-paths problem
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in 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
On symbolic OBDD-based algorithms for the minimum spanning tree problem
Theoretical Computer Science
Implicit computation of maximum bipartite matchings by sublinear functional operations
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Priority functions for the approximation of the metric TSP
Information Processing Letters
The maximum flow problem of uncertain network
Information Sciences: an International Journal
| Hi-index | 0.00 |
We present an algorithm for finding the maximum flow in a 0-1 network. The algorithm is symbolic and does not require explicitenumeration of the nodes and edges of the network. Therefore, it canhandle much larger graphs than it was previously possible (more than10^36 edges). The main idea is to trace (implicitly)sets of edge-disjoint augmenting paths. Disjointness is enforced bysolving an edge matching problem for each layer of the network withthe help of newly defined priority functions.