Skip to main navigation
Skip to search
Skip to main content
Princeton University Home
Help & FAQ
Home
Profiles
Research units
Facilities
Projects
Research output
Press/Media
Search by expertise, name or affiliation
NOTE ON FINDING MINIMUM-COST EDGE-DISJOINT SPANNING TREES.
James Roskind
,
Robert E. Tarjan
Research output
:
Contribution to journal
›
Article
›
peer-review
101
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'NOTE ON FINDING MINIMUM-COST EDGE-DISJOINT SPANNING TREES.'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Edge-disjoint Spanning Trees
100%
Minimum Cost
100%
K-edge
66%
Polynomial Time
33%
Undirected Graph
33%
Greedy Algorithm
33%
Matroid
33%
Computer Science
Spanning Tree
100%
Polynomial Time
33%
Greedy Algorithm
33%
Directed Graphs
33%