Data structures and network algorithms
Data structures and network algorithms
Incremental modular decomposition
Journal of the ACM (JACM)
Theory of 2-structures. Part I: clans, basic subclasses, and morphisms
Theoretical Computer Science
Theory of 2-structures. Part II: representation through labeled tree families
Theoretical Computer Science
Doubly lexical ordering of dense 0–1 matrices
Information Processing Letters
$O(M.N)$ Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs
SIAM Journal on Computing
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
Linear-Time Recognition of Circular-Arc Graphs
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
PC trees and circular-ones arrangements
Theoretical Computer Science - Computing and combinatorics
Finding hidden independent sets in interval graphs
Theoretical Computer Science
Two tricks to triangulate chordal probe graphs in polynomial time
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Discrete Applied Mathematics
2-tree probe interval graphs have a large obstruction set
Discrete Applied Mathematics - Special issue: Max-algebra
Partitioned probe comparability graphs
Theoretical Computer Science
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
A characterization of cycle-free unit probe interval graphs
Discrete Applied Mathematics
The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
2-Tree probe interval graphs have a large obstruction set
Discrete Applied Mathematics
Finding hidden independent sets in interval graphs
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Characterisations and linear-time recognition of probe cographs
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Adjacency matrices of probe interval graphs
Discrete Applied Mathematics
Recognition of probe cographs and partitioned probe distance hereditary graphs
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
On the recognition of probe graphs of some self-complementary classes of perfect graphs
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
The PIGs full monty – a floor show of minimal separators
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Algebraic operations on PQ trees and modular decomposition trees
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Canonical data structure for interval probe graphs
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Recognition of probe proper interval graphs
Discrete Applied Mathematics
| Hi-index | 0.00 |
An interval graph for a set of intervals on a line consists of one vertex for each interval, and an edge for each pair of intersecting intervals. A probe interval graph is obtained from an interval graph by designating a subset P of vertices as probes, and removing the edges between pairs of vertices in the remaining set N of non-probes. We examine the problem of finding and representing possible layouts of the intervals, given a probe interval graph. We obtain an O(n + m log n) bound, where n is the number of vertices and m is the number of edges. The problem is motivated by an application to molecular biology.