A New Algorithm for Optimal Path Finding in Complex Networks Based on the Quotient Space (Q3398971)
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: A New Algorithm for Optimal Path Finding in Complex Networks Based on the Quotient Space |
scientific article; zbMATH DE number 5608719
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A New Algorithm for Optimal Path Finding in Complex Networks Based on the Quotient Space |
scientific article; zbMATH DE number 5608719 |
Statements
A New Algorithm for Optimal Path Finding in Complex Networks Based on the Quotient Space (English)
0 references
29 September 2009
0 references
shortest path
0 references
graph clustering
0 references
quotient graph
0 references
0.7584192156791687
0 references
0.7561780214309692
0 references
0.7522723078727722
0 references
0.7513512969017029
0 references
0.7486622929573059
0 references
