✦ LIBER ✦

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

✍ Scribed by Ting-Yem Ho; Yue-Li Wang; Ming-Tsan Juan

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 488 KB
Volume: 59
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(96)00092-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A linear time algorithm to recognize cir

A linear time algorithm to recognize circular permutation graphs

✍ Sritharan, R. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 368 KB

An undirected graph G is a circular permutation graph if it can be represented by the following intersectiori model: Each vertex of G corresponds to a chord in the annular region between two concentric circles, and two vertices are adjacent in G if and only if their corresponding chords intersect ea

A linear time algorithm for graph partit

A linear time algorithm for graph partition problems

✍ L.H. Clark; F. Shahrokhi; L.A. Székely 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 483 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 simple linear expected time algorithm

A simple linear expected time algorithm for finding a hamilton path

✍ Andrew Thomason 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 496 KB

Discrete Mathematics 75 (1989) 373-379 North-Holland n?", so the problem is one of finding a fast algorithm which works on all graphs in %(n, p) except for a proportion somewhat smaller than 2~". This will be our algorithm A2. A very fast algorithm, which works on most graphs but not on as many as A

A linear-time algorithm for drawing a pl

A linear-time algorithm for drawing a planar graph on a grid

✍ M. Chrobak; T.H. Payne 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 523 KB

A Simple Linear Time Algorithm for Trian

A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs

✍ H. Bodlaender; T. Kloks 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 560 KB

In this paper we consider the problem of determining whether a given colored graph can be triangulated, such that no edges between vertices of the same color are added. This problem originated from the perfect phylogeny problem from molecular biology and is strongly related with the problem of recog