Recognition of graphs with convex quadratic stability number
A stable set of a graph is a set of mutually non-adjacent vertices. The determination of a maximum size stable set, which is called maximum stable set, and the determination of its size, which is called stability number, are central combinatorial optimization problems. However, given a nonnegative i...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | conferenceObject |
| Language: | eng |
| Published: |
2010
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10198/1271 |
| Country: | Portugal |
| Oai: | oai:bibliotecadigital.ipb.pt:10198/1271 |