Partitioning a graph into disjoint cliques and a triangle-free graph (Q2352776)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6455853
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Partitioning a graph into disjoint cliques and a triangle-free graph |
scientific article; zbMATH DE number 6455853 |
Statements
Partitioning a graph into disjoint cliques and a triangle-free graph (English)
0 references
6 July 2015
0 references
computational complexity
0 references
graph partitioning
0 references
special graph classes
0 references
0 references
0.874549925327301
0 references
0.8207804560661316
0 references
0.8177040219306946
0 references
0.8160479068756104
0 references
0.7981531023979187
0 references
