✦ LIBER ✦

Minimizing the number of paths in BDDs: Theory and algorithm

✍ Scribed by Fey, G.; Drechsler, R.

Book ID: 117907435
Publisher: IEEE
Year: 2006
Tongue: English
Weight: 249 KB
Volume: 25
Category: Article
ISSN: 0278-0070
DOI: 10.1109/tcad.2005.852662

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for computing the number of

An algorithm for computing the number of the minimal paths in digital images

✍ P.P. Das 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 450 KB

The Theory of Zero-Suppressed BDDs and t

The Theory of Zero-Suppressed BDDs and the Number of Knight's Tours

✍ Olaf Schröer; Ingo Wegener 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 186 KB

An Application of the Number of Minimal

An Application of the Number of Minimal Lattice Paths to the Theory of Queues

✍ Hiroshi Ohta and Masashi Furukawa 📂 Article 📅 1985 🏛 Palgrave Publishers Ltd. 🌐 English ⚖ 196 KB

Theory Series || An n Job, One Machine S

Theory Series || An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs

✍ J. Michael Moore 📂 Article 📅 1968 🏛 INFORMS 🌐 English ⚖ 911 KB

A new branch and bound algorithm for min

A new branch and bound algorithm for minimizing the weighted number of tardy jobs

✍ Guochun Tang 📂 Article 📅 1990 🏛 Springer US 🌐 English ⚖ 310 KB

Efficient Algorithms for Finding the Max

Efficient Algorithms for Finding the Maximum Number of Disjoint Paths in Grids

✍ Wun-Tat Chan; Francis Y.L. Chin 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 366 KB

In a rectangular grid, given two sets of nodes, S S sources and T T sinks , of size 2 Ž . each, the disjoint paths DP problem is to connect as many nodes in S S to the Ž nodes in T T using a set of ''disjoint'' paths. Both edge-disjoint and ¨ertex-disjoint . cases are considered in this paper. Note