Maximum $r$-Regular Induced Subgraph Problem: Fast Exponential Algorithms and Combinatorial Bounds (Q4915198): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/09077850x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1983652976 / rank | |||
Normal rank | |||
Latest revision as of 09:59, 30 July 2024
scientific article; zbMATH DE number 6152410
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
