✦ LIBER ✦

A linear algorithm to determine minimal spanning forests in chain graphs

✍ Scribed by F. Luccio; L. Pagli

Book ID: 113162448
Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 442 KB
Volume: 15
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(82)90074-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A linear time algorithm to list the mini

A linear time algorithm to list the minimal separators of chordal graphs

✍ L. Sunil Chandran; Fabrizio Grandoni 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 193 KB

A Randomized Linear-Work EREW PRAM Algor

A Randomized Linear-Work EREW PRAM Algorithm to Find a Minimum Spanning Forest

✍ Chung and Vijaya 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 72 KB

A counterexample to the algorithms for d

A counterexample to the algorithms for determining opaque minimal forests

✍ Thomas Shermer 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 117 KB

A self-stabilizing distributed algorithm

A self-stabilizing distributed algorithm for minimal spanning tree problem in a symmetric graph

✍ G. Antonoiu; P.K. Srimani 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 640 KB

Minimal Spanning Tree (MST) problem in an arbitrary undirected graph is an important problem in graph theory and has extensive applications. Numerous algorithms are available to compute an MST. Our purpose here is to propose a self-stabilizing distributed algorithm for the MST problem and to prove i

A linear-time algorithm to find a pair o

A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph

✍ Kristóf Bérczi; Satoru Fujishige; Naoyuki Kamiyama 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 185 KB

A linear time algorithm to solve the wei

A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs

✍ Chain-Chin Yen; R.C.T. Lee 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 379 KB