Complexity of finding maximum regular induced subgraphs with prescribed degree (Q401302): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 00:10, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of finding maximum regular induced subgraphs with prescribed degree |
scientific article |
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
