Solving Graph Optimization Problems with ZBDDs

Authors:
O. Coudert
Affiliations:
Synopsys, Inc., 700 East Middlefield Rd., Mountain View, CA
Venue:
EDTC '97 Proceedings of the 1997 European conference on Design and Test
Year:
1997

Citing 10
Cited 5

Zero-suppressed BDDs for set manipulation in combinatorial problems

DAC '93 Proceedings of the 30th international Design Automation Conference
A fully implicit algorithm for exact state minimization

DAC '94 Proceedings of the 31st annual Design Automation Conference
Two-level logic minimization: an overview

Integration, the VLSI Journal
Multi-way partitioning for minimum delay for look-up table based FPGAs

DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
On solving covering problems

DAC '96 Proceedings of the 33rd annual Design Automation Conference
Synthesis and Optimization of Digital Circuits

Synthesis and Optimization of Digital Circuits
Logic Minimization Algorithms for VLSI Synthesis

Logic Minimization Algorithms for VLSI Synthesis
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Fast factorization method for implicit cube set representation

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Local ratio cut and set covering partitioning for huge logic emulation systems

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Resolution cannot polynomially simulate compressed-BFS

Annals of Mathematics and Artificial Intelligence
Are zero-suppressed binary decision diagrams good for mining frequent patterns in high dimensional datasets?

AusDM '07 Proceedings of the sixth Australasian conference on Data mining and analytics - Volume 70
Using ZBDDs in Points-to Analysis

Languages and Compilers for Parallel Computing
Recurrence-aware instruction set selection for extensible embedded processors

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
VSOP (valued-sum-of-products) calculator for knowledge processing based on zero-suppressed BDDs

Proceedings of the 2005 international conference on Federation over the Web

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a ZBDD (Zero-Suppressed Binary Decision Diagram) based framework that solves a collection of graph optimization problems. We show how these problems reduce to three primitive problems, and how the later can be solved exactly using ZBDDs. The application of this framework is illustrated on multilayer planar routing, where it can solve real-life instances that cannot be handled otherwise.