On recognition of threshold tolerance graphs and their complements
From MaRDI portal
Publication:344853
DOI10.1016/J.DAM.2015.01.034zbMATH Open1350.05054OpenAlexW2000263143MaRDI QIDQ344853FDOQ344853
Petr A. Golovach, Vinícius F. dos Santos, R. M. McConnell, Nathan Lindzey, Jayme L. Szwarcfiter, Pinar Heggernes, Jeremy P. Spinrad
Publication date: 24 November 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.01.034
Recommendations
Cites Work
- Title not available (Why is that?)
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Efficient graph representations
- Linear-time recognition of circular-arc graphs
- Title not available (Why is that?)
- Doubly lexical ordering of dense 0--1 matrices
- Three Partition Refinement Algorithms
- Characterizations of strongly chordal graphs
- Algorithmic Aspects of Vertex Elimination on Graphs
- Perfect Elimination and Chordal Bipartite Graphs
- Title not available (Why is that?)
- Co-TT graphs and a characterization of split co-TT graphs
- Threshold tolerance graphs
Cited In (8)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Recognition of linear and star variants of leaf powers is in P
- Mutual transferability for \((F, B, R)\)-domination on strongly chordal graphs and cactus graphs
- Threshold tolerance graphs
- Query-competitive sorting with uncertainty
- Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2
- Min-Orderable Digraphs
This page was built for publication: On recognition of threshold tolerance graphs and their complements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q344853)
