The maximum interval graphs on distance hereditary graphs

DOI

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.

Copyright

© 2006, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

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  - Proceedings of the 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  - 10.2991/jcis.2006.210
ID  - Peng2006/10
ER  -