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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 03D15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68R10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C70 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 4130005 / rank
 
Normal rank
Property / zbMATH Keywords
 
complexity theory
Property / zbMATH Keywords: complexity theory / rank
 
Normal rank
Property / zbMATH Keywords
 
computational complexity
Property / zbMATH Keywords: computational complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
High Degree Vertex Removal Problem
Property / zbMATH Keywords: High Degree Vertex Removal Problem / rank
 
Normal rank
Property / zbMATH Keywords
 
Low Degree Vertex Removal Problem
Property / zbMATH Keywords: Low Degree Vertex Removal Problem / rank
 
Normal rank
Property / zbMATH Keywords
 
NP-complete
Property / zbMATH Keywords: NP-complete / rank
 
Normal rank
Property / zbMATH Keywords
 
Low Degree Subgraph Problem
Property / zbMATH Keywords: Low Degree Subgraph Problem / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0022-0000(89)90026-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2030970081 / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

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