Solving graph optimization problems with ZBDDs
Olivier Coudert · European Design and Test Conference · 1997
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.