✦ LIBER ✦

Linear time algorithm for finding a picture's connected components

✍ Scribed by P Thanisch; BV McNally; A Robin

Book ID: 113302059
Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 816 KB
Volume: 2
Category: Article
ISSN: 0262-8856
DOI: 10.1016/0262-8856(84)90022-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A linear-time algorithm for finding a sp

A linear-time algorithm for finding a sparsek-connected spanning subgraph of ak-connected graph

✍ Hiroshi Nagamochi; Toshihide Ibaraki 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 684 KB

A linear-time algorithm for finding all

A linear-time algorithm for finding all feedback vertices

✍ Michael R. Garey; Robert E. Tarjan 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 468 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

A linear systolic algorithm for the conn

A linear systolic algorithm for the connected component problem

✍ Shing-Tsaan Huang; Ming-Shin Tsai 📂 Article 📅 1989 🏛 Springer Netherlands 🌐 English ⚖ 532 KB

A linear-time algorithm for finding a mi

A linear-time algorithm for finding a minimum spanning pseudoforest

✍ Harold N. Gabow; Robert E. Tarjan 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 460 KB

A Linear-Time Algorithm for Finding a Ma

A Linear-Time Algorithm for Finding a Maximal Planar Subgraph

✍ Djidjev, Hristo N. 📂 Article 📅 2006 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 214 KB