𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A linear-time algorithm for computing K-terminal reliability on proper interval graphs

✍ Scribed by Min-Sheng Lin

Book ID
114555976
Publisher
IEEE
Year
2002
Tongue
English
Weight
288 KB
Volume
51
Category
Article
ISSN
0018-9529

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A linear time recognition algorithm for
A linear time recognition algorithm for proper interval graphs
✍ B.S. Panda; Sajal K. Das πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 128 KB

We propose a linear time recognition algorithm for proper interval graphs. The algorithm is based on certain ordering of vertices, called bicompatible elimination ordering (BCO). Given a BCO of a biconnected proper interval graph G, we also propose a linear time algorithm to construct a Hamiltonian

A linear-time algorithm for the weighted
A linear-time algorithm for the weighted feedback vertex problem on interval graphs
✍ Chin Lung Lu; Chuan Yi Tang πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 459 KB

We present a linear-time algorithm for finding a minimum weighted feedback vertex set on interval graphs using the dynamic programming technique. Since the weighted feedback vertex problem, the weighted C3.1 problem, the maximum weighted 2-colorable subgraph problem and the maximum weighted 2-indepe

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