On the complexity of diagram testing (Q1319079): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3291034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs that can be oriented as diagrams of ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On reorienting graphs by pushing down maximal vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3726174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced graphs and noncovering graphs / rank
 
Normal rank

Latest revision as of 13:29, 22 May 2024

scientific article
Language Label Description Also known as
English
On the complexity of diagram testing
scientific article

    Statements

    On the complexity of diagram testing (English)
    0 references
    0 references
    15 March 1995
    0 references
    orientation
    0 references
    NP-completeness
    0 references
    finite poset
    0 references
    diagram
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references