Recognizing strict 2-threshold graphs in O(m) time
type: Item
instance of: scholarly article
title: Recognizing strict 2-threshold graphs in O(m) time
zbMATH Open document ID: 0875.68453
DOI: 10.1016/0020-0190(95)00030-G
author: Rossella Petreschi
author: Andrea Sterbini
published in: Information Processing Letters
publication date: 1997-02-28T00:00:00Z
Mathematics Subject Classification ID: 68W10
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 985694
zbMATH Keywords: Algorithms
zbMATH Keywords: Recognition algorithms
zbMATH Keywords: Threshold graphs
zbMATH Keywords: Threshold number
MaRDI profile type: Publication
cites work: Q4165164
cites work: Some properties of 2-threshold graphs
cites work: On the notion of balance of a signed graph
cites work: A Graph-Theoretic Characterization of the $\text{PV}_{\text{chunk}}$ Class of Synchronizing Primitives
cites work: Strict 2-threshold graphs
cites work: Q4134007
cites work: The Complexity of the Partial Order Dimension Problem
full work available at URL: 0020-0190(95)00030-g
OpenAlex ID: W2022597688
description: scientific article; zbMATH DE number 985694