Ordered vertex removal and subgraph problems (Q582090): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A taxonomy of problems with fast parallel algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4128417 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4130999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniform circuit complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131648 / rank
 
Normal rank

Latest revision as of 12:11, 20 June 2024

scientific article
Language Label Description Also known as
English
Ordered vertex removal and subgraph problems
scientific article

    Statements

    Ordered vertex removal and subgraph problems (English)
    0 references
    0 references
    1989
    0 references
    complexity theory
    0 references
    computational complexity
    0 references
    High Degree Vertex Removal Problem
    0 references
    Low Degree Vertex Removal Problem
    0 references
    NP-complete
    0 references
    Low Degree Subgraph Problem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references