On probe interval graphs
From MaRDI portal
Recommendations
- Characterizing interval graphs which are probe unit interval graphs
- Probe interval graphs and STS-probe interval graphs
- Recognition of probe proper interval graphs
- Tagged probe interval graphs
- Adjacency matrices of probe interval graphs
- scientific article; zbMATH DE number 1923007
- scientific article; zbMATH DE number 1735726
- Probe interval and probe unit interval graphs on superclasses of cographs
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3891425 (Why is no real title available?)
- An Incremental Linear-Time Algorithm for Recognizing Interval Graphs
- Complexity and algorithms for graph and hypergraph sandwich problems
- Incidence matrices and interval graphs
- Permuting matrices to avoid forbidden submatrices
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Weakly triangulated graphs
Cited in
(37)- A vertex ordering result for tripartite unit probe interval graphs
- Block-graph width
- Recognizing edge clique graphs among interval graphs and probe interval graphs
- scientific article; zbMATH DE number 1933220 (Why is no real title available?)
- Partitioned probe comparability graphs
- Interval graphs and maps of DNA
- On probe permutation graphs
- 2-tree probe interval graphs have a large obstruction set
- Characterisations and Linear-Time Recognition of Probe Cographs
- Sandwich and probe problems for excluding paths
- On the probe problem for \((r,\ell )\)-well-coveredness
- Tagged probe interval graphs
- scientific article; zbMATH DE number 1982187 (Why is no real title available?)
- scientific article; zbMATH DE number 2119749 (Why is no real title available?)
- Recognition of split-graphic sequences
- Algorithms and Computation
- Adjacency matrices of probe interval graphs
- Recognition of probe proper interval graphs
- A characterization of cycle-free unit probe interval graphs
- scientific article; zbMATH DE number 840682 (Why is no real title available?)
- Probe interval orders
- Probe interval and probe unit interval graphs on superclasses of cographs
- The sandwich problem for decompositions and almost monotone properties
- Clique-detection models in computational biochemistry and genomics
- On characterization and recognition of proper tagged probe interval graphs
- Chordal probe graphs
- A graph-theoretic barcode ordering model for linked-reads
- Probe interval graphs and probe unit interval graphs on superclasses of cographs
- A characterization of chain probe graphs
- On the perfectness of tagged probe interval graphs
- Good characterizations and linear time recognition for 2-probe block graphs
- A characterization of 2-tree probe interval graphs
- On the bi-enhancement of chordal-bipartite probe graphs
- On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity
- The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs
- A polynomial time recognition algorithm for probe interval graphs
- Interval \(k\)-graphs and orders
This page was built for publication: On probe interval graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1281778)