Complexity of finding maximum regular induced subgraphs with prescribed degree (Q401302)
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: Complexity of finding maximum regular induced subgraphs with prescribed degree |
scientific article; zbMATH DE number 6334501
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of finding maximum regular induced subgraphs with prescribed degree |
scientific article; zbMATH DE number 6334501 |
Statements
Complexity of finding maximum regular induced subgraphs with prescribed degree (English)
0 references
26 August 2014
0 references
bipartite graph
0 references
chordal graph
0 references
graph algorithm
0 references
inapproximability
0 references
planar graph
0 references
regular induced subgraph
0 references
treewidth
0 references
0 references
0 references
0.9933380484580994
0 references
0.8407036066055298
0 references
0.8363214135169983
0 references
0.8255674839019775
0 references
0.8149396777153015
0 references
