Recognizing threshold tolerance graphs in O(n^2) time
DOI10.1007/978-3-319-12340-0_18zbMATH Open1417.05208OpenAlexW2174180199MaRDI QIDQ2945191FDOQ2945191
Authors: Petr A. Golovach, Pinar Heggernes, Nathan Lindzey, R. M. McConnell, Vinícius F. dos Santos, Jeremy P. Spinrad 
Publication date: 9 September 2015
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-12340-0_18
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Signed and weighted graphs (05C22) Structural characterization of families of graphs (05C75)
Cites Work
- Title not available (Why is that?)
- Graph Classes: A Survey
- 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?)
- Title not available (Why is that?)
- Doubly lexical ordering of dense 0--1 matrices
- Characterizations of strongly chordal graphs
- Algorithmic Aspects of Vertex Elimination on Graphs
- Perfect Elimination and Chordal Bipartite Graphs
- Co-TT graphs and a characterization of split co-TT graphs
- Threshold tolerance graphs
- Tolerance graphs
- Title not available (Why is that?)
Cited In (5)
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)
