Recognition of graphs with convex quadratic stability number
A maximum stable set is a stable set with the largest possible size, for a given graph G. This size is called the stability number of G, and it is denoted α(G). The problem of determining the stability number of an arbitrary graph, is a NP-complete optimization problem. As such, it is unlikely that...
| Autor principal: | |
|---|---|
| Formato: | doctoralThesis |
| Idioma: | eng |
| Publicado em: |
2020
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10773/29883 |
| País: | Portugal |
| Oai: | oai:ria.ua.pt:10773/29883 |