Publication Date

9-5-2016

Abstract

Recognition of probe interval graphs has been studied extensively. Recognition algorithms of probe interval graphs can be broken down into two types of problems: partitioned and non-partitioned. A partitioned recognition algorithm includes the probe and nonprobe partition of the vertices as part of the input, where a non-partitioned algorithm does not include the partition. Partitioned probe interval graphs can be recognized in linear-time in the edges, whereas non-partitioned probe interval graphs can be recognized in polynomial-time. Here we present a non-partitioned recognition algorithm for 2-trees, an extension of trees, that are probe interval graphs. We show that this algorithm runs in O(m) time, where m is the number of edges of a 2-tree. Currently there is no algorithm that performs as well for this problem.

Publisher

SCIENCEDOMAIN international

Journal

British Journal of Mathematics & Computer Science

Volume Number

18

Issue Number

4

First Page Number

1

Last Page Number

11

DOI

10.9734/BJMCS/2016/28344

Type

Article

Department

Mathematics

Rights

In Copyright (InC)

Creative Commons License

Creative Commons Attribution 4.0 License
This work is licensed under a Creative Commons Attribution 4.0 License.

Included in

Mathematics Commons

Share

COinS