title: |
The maximum interval graphs on distance hereditary graphs |
|
publication: |
||
part of series: |
Advances in Intelligent Systems Research | |
ISBN: |
978-90-78677-01-7 | |
ISSN: |
1951-6851 | |
DOI: |
doi:10.2991/jcis.2006.210 (how to use a DOI) | |
author(s): |
Sheng-Lung Peng, Ton Kloks, Chuan-Min Lee |
|
corresponding author: |
||
publication date: |
October 2006 |
|
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: |
©
Atlantis Press. This is an open-access article distributed under the
terms of the Creative Commons Attribution License, which permits
non-commercial use, distribution and reproduction in any medium,
provided the original work is properly cited. |
|
full text: |