Recognizing threshold tolerance graphs in O(n^2) time
From MaRDI portal
Recommendations
Cites work
- Algorithmic Aspects of Vertex Elimination on Graphs
- Characterizations of strongly chordal graphs
- Co-TT graphs and a characterization of split co-TT graphs
- Doubly lexical ordering of dense 0--1 matrices
- Efficient graph representations
- Graph Classes: A Survey
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3598234 (Why is no real title available?)
- scientific article; zbMATH DE number 2090048 (Why is no real title available?)
- scientific article; zbMATH DE number 2117210 (Why is no real title available?)
- Linear-time recognition of circular-arc graphs
- Perfect Elimination and Chordal Bipartite Graphs
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Threshold tolerance graphs
- Tolerance graphs
Cited in
(7)- Co-TT graphs and a characterization of split co-TT graphs
- An \(O(n^3)\) time algorithm for recognizing threshold dimension 2 graphs
- On recognition of threshold tolerance graphs and their complements
- Threshold tolerance graphs
- Linear-time recognition of double-threshold graphs
- Linear-time recognition of double-threshold graphs
- Recognizing strict 2-threshold graphs in O(m) time
This page was built for publication: Recognizing threshold tolerance graphs in \(O(n^2)\) time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2945191)