Sparse connectivity certificates via MA orderings in graphs (Q860401)
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 5083148
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sparse connectivity certificates via MA orderings in graphs |
scientific article; zbMATH DE number 5083148 |
Statements
Sparse connectivity certificates via MA orderings in graphs (English)
0 references
9 January 2007
0 references
edge-connectivity
0 references
vertex-connectivity
0 references
connectivity certificates
0 references
mixed cuts
0 references
removable cycles
0 references
spanning subgraphs
0 references
0 references
0 references
0 references
0.7709147334098816
0 references
0.769002377986908
0 references
0.7682830691337585
0 references
0.7677497863769531
0 references
0.7586843371391296
0 references
