Algorithmic complexity of weakly semiregular partitioning and the representation number (Q528476)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithmic complexity of weakly semiregular partitioning and the representation number |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithmic complexity of weakly semiregular partitioning and the representation number |
scientific article |
Statements
Algorithmic complexity of weakly semiregular partitioning and the representation number (English)
0 references
12 May 2017
0 references
weakly semiregular number
0 references
semiregular number
0 references
edge-partition problems
0 references
locally irregular graph
0 references
representation number
0 references
0 references
0.7735950946807861
0 references
0.7451532483100891
0 references
0.7145557403564453
0 references
0.7126212120056152
0 references
0.7083614468574524
0 references
