Minimum vertex cover in rectangle graphs (Q551504): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C70 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5929156 / rank
 
Normal rank
Property / zbMATH Keywords
 
approximation algorithms
Property / zbMATH Keywords: approximation algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
axis-parallel rectangles
Property / zbMATH Keywords: axis-parallel rectangles / rank
 
Normal rank
Property / zbMATH Keywords
 
intersection graphs
Property / zbMATH Keywords: intersection graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
arrangement graphs
Property / zbMATH Keywords: arrangement graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
pseudo-disks
Property / zbMATH Keywords: pseudo-disks / rank
 
Normal rank

Revision as of 12:47, 1 July 2023

scientific article
Language Label Description Also known as
English
Minimum vertex cover in rectangle graphs
scientific article

    Statements

    Minimum vertex cover in rectangle graphs (English)
    0 references
    0 references
    0 references
    0 references
    20 July 2011
    0 references
    approximation algorithms
    0 references
    axis-parallel rectangles
    0 references
    intersection graphs
    0 references
    arrangement graphs
    0 references
    pseudo-disks
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references