Proceedings of the 9th Joint International Conference on Information Sciences (JCIS-06)

The maximum interval graphs on distance hereditary graphs

Authors
Sheng-Lung Peng 0, Ton Kloks, Chuan-Min Lee
Corresponding Author
Sheng-Lung Peng
0National Dong Hwa University
Available Online October 2006.
DOI
https://doi.org/10.2991/jcis.2006.210How to use a DOI?
Keywords
distance hereditary graphs, interval graphs, node-deletion problem
Abstract
In this paper we propose a linear-time algorithm to solve the problem of finding an induced interval graph with a maximum number of vertices in a distance hereditary graph.
Open Access
This is an open access article distributed under the CC BY-NC license.

Download article (PDF)

Proceedings
9th Joint International Conference on Information Sciences (JCIS-06)
Part of series
Advances in Intelligent Systems Research
Publication Date
October 2006
ISBN
978-90-78677-01-7
ISSN
1951-6851
DOI
https://doi.org/10.2991/jcis.2006.210How to use a DOI?
Open Access
This is an open access article distributed under the CC BY-NC license.

Cite this article

TY  - CONF
AU  - Sheng-Lung Peng
AU  - Ton Kloks
AU  - Chuan-Min Lee
PY  - 2006/10
DA  - 2006/10
TI  - The maximum interval graphs on distance hereditary graphs
BT  - 9th Joint International Conference on Information Sciences (JCIS-06)
PB  - Atlantis Press
SP  - 449
EP  - 452
SN  - 1951-6851
UR  - https://doi.org/10.2991/jcis.2006.210
DO  - https://doi.org/10.2991/jcis.2006.210
ID  - Peng2006/10
ER  -