Recognition of probe proper interval graphs

Authors:
Yahav Nussbaum
Affiliations:
-
Venue:
Discrete Applied Mathematics
Year:
2014

Citing 13
Cited 0

Regular Article: On the Complexity of DNA Physical Mapping

Advances in Applied Mathematics
On probe interval graphs

Discrete Applied Mathematics - Special volume on computational molecular biology DAM-CMB series volume 2
A polynomial time recognition algorithm for probe interval graphs

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Construction of probe interval models

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs

SIAM Journal on Computing
A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs

SIAM Journal on Computing
Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs

SIAM Journal on Discrete Mathematics
Partitioned probe comparability graphs

Theoretical Computer Science
A characterization of cycle-free unit probe interval graphs

Discrete Applied Mathematics
2-Tree probe interval graphs have a large obstruction set

Discrete Applied Mathematics
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Journal of Computer and System Sciences
Characterisations and linear-time recognition of probe cographs

WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
The PIGs full monty – a floor show of minimal separators

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science

Quantified Score

Hi-index	0.04

Visualization

Abstract

In a partitioned probe graph the vertex set is partitioned into probes and non-probes, such that the set of non-probes is an independent set. A probe proper interval graph is the intersection graph of a set of intervals on the line such that every vertex is mapped to an interval, no interval contains another, and two vertices are adjacent if and only if the corresponding intervals intersect and at least one of them is a probe. We present the first linear-time algorithm that determines whether an input partitioned probe graph is a probe proper interval graph, and if the answer is positive then the algorithm constructs a corresponding set of intervals.