๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A simple linear-time algorithm for the recognition of bandwidth-2 biconnected graphs

โœ Scribed by Fillia Makedon; Dafna Sheinwald; Yaron Wolfsthal

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
382 KB
Volume
46
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

A Simple Linear Time Algorithm for Prope
A Simple Linear Time Algorithm for Proper Box Rectangular Drawings of Plane Graphs
โœ Xin He ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 219 KB

In this paper we introduce a new style of drawing a plane graph G, called proper ลฝ . box rectangular PBR drawing. It is defined to be a drawing of G such that every vertex is drawn as a rectangle, called a box, each edge is drawn as either a horizontal or a vertical line segment, and each face is dr