Skip to main navigation
Skip to search
Skip to main content
Home
Profiles
Departments and Centers
Scholarly Works
Activities
Equipment
Grants
Prizes
Search by expertise, name or affiliation
An O(n log n) average time algorithm for computing the shortest network under a given topology
G. Xue
, D. Z. Du
Research output
:
Contribution to journal
›
Article
›
peer-review
1
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'An O(n log n) average time algorithm for computing the shortest network under a given topology'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Time-average
Computing
Fixed point
Euclidean plane
Engineering & Materials Science
Topology