✦ LIBER ✦

A linear-time algorithm for finding all feedback vertices

✍ Scribed by Michael R. Garey; Robert E. Tarjan

Book ID: 113161964
Publisher: Elsevier Science
Year: 1978
Tongue: English
Weight: 468 KB
Volume: 7
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(78)90015-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A linear time algorithm for finding all

A linear time algorithm for finding all hinge vertices of a permutation graph

✍ Ting-Yem Ho; Yue-Li Wang; Ming-Tsan Juan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 488 KB

Computational results on an algorithm fo

Computational results on an algorithm for finding all vertices of a polytope

✍ T. H. Mattheiss; Brian K. Schmidt 📂 Article 📅 1980 🏛 Springer-Verlag 🌐 English ⚖ 627 KB

A linear time algorithm for finding all

A linear time algorithm for finding all farthest neighbors in a convex polygon

✍ Alok Aggarwal; Dina Kravets 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 416 KB

An Efficient Algorithm for Finding All H

An Efficient Algorithm for Finding All Hinge Vertices on Trapezoid Graphs

✍ Bera; Pal; Pal 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 114 KB

A Linear Time Algorithm for Finding ak-T

A Linear Time Algorithm for Finding ak-Tree Core

✍ Akiyoshi Shioura; Takeaki Uno 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 173 KB

Given a tree containing n vertices, consider the sum of the distance between all Ž . vertices and a k-leaf subtree subtree which contains exactly k leaves . A k-tree core is a k-leaf subtree which minimizes the sum of the distances. In this paper, we propose a linear time algorithm for finding a k-t

Linear time algorithm for finding a pict

Linear time algorithm for finding a picture's connected components

✍ P Thanisch; BV McNally; A Robin 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 816 KB