On the weighted complexity of a group covering of a digraph (Q3053013)
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: On the weighted complexity of a group covering of a digraph |
scientific article; zbMATH DE number 5809776
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the weighted complexity of a group covering of a digraph |
scientific article; zbMATH DE number 5809776 |
Statements
3 November 2010
0 references
complexity
0 references
digraph covering
0 references
Laplacian matrix
0 references
0.8922408223152161
0 references
0.8814408183097839
0 references
0.8532944321632385
0 references
0.7326629757881165
0 references
0.731312096118927
0 references
