𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A linear time algorithm for liarʼs domination problem in proper interval graphs

✍ Scribed by Panda, B.S.; Paul, S.

Book ID
125421356
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
367 KB
Volume
113
Category
Article
ISSN
0020-0190

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