Complexity of finding maximum regular induced subgraphs with prescribed degree (Q401302): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C85 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C62 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C75 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q17 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q25 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68R10 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6334501 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
bipartite graph | |||
| Property / zbMATH Keywords: bipartite graph / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
chordal graph | |||
| Property / zbMATH Keywords: chordal graph / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
graph algorithm | |||
| Property / zbMATH Keywords: graph algorithm / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
inapproximability | |||
| Property / zbMATH Keywords: inapproximability / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
planar graph | |||
| Property / zbMATH Keywords: planar graph / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
regular induced subgraph | |||
| Property / zbMATH Keywords: regular induced subgraph / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
treewidth | |||
| Property / zbMATH Keywords: treewidth / rank | |||
Normal rank | |||
Revision as of 17:25, 29 June 2023
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
