Minimum degree orderings (Q848936)
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 5674318
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum degree orderings |
scientific article; zbMATH DE number 5674318 |
Statements
Minimum degree orderings (English)
0 references
23 February 2010
0 references
edge-connectivity
0 references
extreme subsets
0 references
graph algorithms
0 references
maximum adjacency orderings
0 references
minimum cuts
0 references
minimum degree orderings
0 references
submodular functions
0 references
posi-modular functions
0 references
0 references
0 references
0.9982460737228394
0 references
0.7841706275939941
0 references
0.7841706275939941
0 references
0.7389140129089355
0 references
0.7303066253662109
0 references
