Subexponential-time algorithms for Maximum Independent Set and related problems on box graphs (Q3082912)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Subexponential-time algorithms for Maximum Independent Set and related problems on box graphs |
scientific article; zbMATH DE number 5867673
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Subexponential-time algorithms for Maximum Independent Set and related problems on box graphs |
scientific article; zbMATH DE number 5867673 |
Statements
Subexponential-Time Algorithms for Maximum Independent Set and Related Problems on Box Graphs (English)
0 references
18 March 2011
0 references
box graph
0 references
orthogonal rectangles
0 references
maximum independent set
0 references
minimum vertex cover
0 references
maximum induced subgraph
0 references
0.9426135420799256
0 references
0.8314797878265381
0 references
0.7810114026069641
0 references
0.7735923528671265
0 references
