Recognizing strict 2-threshold graphs in O(m) time (Q673666): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4165164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some properties of 2-threshold graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the notion of balance of a signed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Graph-Theoretic Characterization of the $\text{PV}_{\text{chunk}}$ Class of Synchronizing Primitives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strict 2-threshold graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4134007 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of the Partial Order Dimension Problem / rank
 
Normal rank

Revision as of 10:27, 27 May 2024

scientific article
Language Label Description Also known as
English
Recognizing strict 2-threshold graphs in O(m) time
scientific article

    Statements

    Recognizing strict 2-threshold graphs in O(m) time (English)
    0 references
    0 references
    0 references
    28 February 1997
    0 references
    Algorithms
    0 references
    Recognition algorithms
    0 references
    Threshold graphs
    0 references
    Threshold number
    0 references

    Identifiers