Monopolar graphs: complexity of computing classical graph parameters (Q2659081)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Monopolar graphs: complexity of computing classical graph parameters |
scientific article |
Statements
Monopolar graphs: complexity of computing classical graph parameters (English)
0 references
25 March 2021
0 references
computational complexity
0 references
monopolar graph
0 references
maximum-weight clique
0 references
clique partitioning
0 references
stable set
0 references
graph coloring
0 references
0 references
