Linear algorithm for selecting an almost regular spanning subgraph in an almost regular graph (Q764406)
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: Linear algorithm for selecting an almost regular spanning subgraph in an almost regular graph |
scientific article; zbMATH DE number 6014364
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear algorithm for selecting an almost regular spanning subgraph in an almost regular graph |
scientific article; zbMATH DE number 6014364 |
Statements
Linear algorithm for selecting an almost regular spanning subgraph in an almost regular graph (English)
0 references
13 March 2012
0 references
almost \(d\)-regular graphs
0 references
0.8891531
0 references
0.8831863
0 references
0.87932795
0 references
0.8728222
0 references
0.8695084
0 references
0.8673965
0 references
0.8650931
0 references
0.8645104
0 references
