✦ LIBER ✦

An algorithm for partitioning trees augmented with sibling edges

✍ Scribed by Rajesh Bordawekar; Oded Shmueli

Book ID: 108154571
Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 217 KB
Volume: 108
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2008.04.010

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for constructing edge-trees

An algorithm for constructing edge-trees from hypergraphs

✍ Fǎnicǎ Gavril; Robert Tamari 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 628 KB

A -approximation algorithm for minimum-c

A -approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius

✍ Cohen, Nachshon; Nutov, Zeev 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 423 KB

An augmented spatial digital tree algori

An augmented spatial digital tree algorithm for contact detection in computational mechanics

✍ Y. T. Feng; D. R. J. Owen 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 276 KB

Analysis of an approximate greedy algori

Analysis of an approximate greedy algorithm for the maximum edge clique partitioning problem

✍ Abraham P. Punnen; Ruonan Zhang 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 186 KB

State space partition algorithms for sto

State space partition algorithms for stochastic systems with applications to minimum spanning trees

✍ Alexopoulos, Christos; Jacobson, Jay A. 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 210 KB 👁 2 views

We investigated state space partition methods for computing probability measures related to the operation of stochastic systems and present new theoretical results concerning their efficiency. These methods iteratively partition the system state space, producing at each step progressively tighter bo

An optimal algorithm for rectilinear ste

An optimal algorithm for rectilinear steiner trees for channels with obstacles

✍ Charles Chiang; Majid Sarrafzadeh; C. K. Wong 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 835 KB