Spectral bounds for the k-regular induced subgraph problem
Many optimization problems on graphs are reduced to the determination of a subset of vertices of maximum cardinality which induces a $k$-regular subgraph. For example, a maximum independent set, a maximum induced matching and a maximum clique is a maximum cardinality $0$-regular, $1$-regular and $(\...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | bookPart |
| Language: | eng |
| Published: |
2017
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10773/17120 |
| Country: | Portugal |
| Oai: | oai:ria.ua.pt:10773/17120 |