Fast algorithm of equitably partitioning degenerate graphs into graphs with lower degeneracy (Q2072075)
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 7467476
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast algorithm of equitably partitioning degenerate graphs into graphs with lower degeneracy |
scientific article; zbMATH DE number 7467476 |
Statements
Fast algorithm of equitably partitioning degenerate graphs into graphs with lower degeneracy (English)
0 references
1 February 2022
0 references
network partition
0 references
equitable coloring
0 references
tree coloring
0 references
degenerate graph
0 references
cubic-time algorithm
0 references
0.8211154341697693
0 references
0.8066160082817078
0 references
0.7933048009872437
0 references
0.7874284386634827
0 references
0.7847669124603271
0 references
