Maximum \(r\)-regular induced subgraph problem: fast exponential algorithms and combinatorial bounds (Q4915198)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6152410
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum \(r\)-regular induced subgraph problem: fast exponential algorithms and combinatorial bounds |
scientific article; zbMATH DE number 6152410 |
Statements
Maximum $r$-Regular Induced Subgraph Problem: Fast Exponential Algorithms and Combinatorial Bounds (English)
0 references
9 April 2013
0 references
maximal \(r\)-regular subgraphs
0 references
combinatorial upper and lower bounds
0 references
exact exponential time algorithms
0 references
0.9530090093612672
0 references
0.8483308553695679
0 references
0.8317306637763977
0 references
0.8255674839019775
0 references
0.814781129360199
0 references
