An \(O(n^ 3)\) recognition algorithm for bithreshold graphs
From MaRDI portal
Publication:676270
DOI 10.1007/BF02523681</link>zbMath 0869.68068</link>OpenAlex W2040237824</link>MaRDI QID Q676270</link>
Andrea Sterbini, Rossella Petreschi, Sergio De Agostino
Publication date: 20 August 1997
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02523681
Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Cites Work
- Unnamed Item
- Unnamed Item
- Recognizing strict 2-threshold graphs in O(m) time
- Bipartite bithreshold graphs
- Bin-packing and matchings in threshold graphs
- Threshold Dimension of Graphs
- The Complexity of the Partial Order Dimension Problem
- Bithreshold Graphs
- Some properties of 2-threshold graphs
- Minimal Threshold Separators and Memory Requirements for Synchronization
- Sufficient Conditions for Graphs to Have Threshold Number 2
- ON PVchunk OPERATIONS AND MATROGENIC GRAPHS
- A Graph-Theoretic Characterization of the $\text{PV}_{\text{chunk}}$ Class of Synchronizing Primitives
This page was built for publication: An \(O(n^ 3)\) recognition algorithm for bithreshold graphs
