Back to Results
First PageMeta Content
Spanning tree / Network theory / Shortest path problem / Minimum spanning tree / Planar graph / Polyhedron / Tree / Dodecahedron / Nearest neighbor graph / Graph theory / Mathematics / Theoretical computer science


Minimum Spanning Trees on Polyhedra Michael J. Spriggs J. Mark Keil Department of Computer Science
Add to Reading List

Document Date: 2003-06-20 16:04:26


Open Document

File Size: 72,75 KB

Share Result on Facebook

Company

ABC / Vertex / PMST / /

/

Facility

Computer Science University / Computer Science University of Saskatchewan Department / /

IndustryTerm

generation algorithm / polyhedral shortest-path algorithms / simplex range-search data structure / singlesource algorithm / range-search structure stores / source site / particular source site / computing / tree algorithm / source-site / range-search data structure / edgesequence tree algorithm / range1+ search tree / shortest-path algorithm / first generating the range1+ search tree / /

Organization

Computer Science University of Saskatchewan Department / University of Saskatchewan / Polyhedra Michael J. Spriggs J. Mark Keil Department / /

ProvinceOrState

Alberta / Saskatchewan / British Columbia / /

Technology

singlesource algorithm / RAM / edgesequence tree algorithm / generation algorithm / component algorithms / MST algorithm / polyhedral shortest-path algorithms / basic MST algorithm / second algorithm / shortest-path algorithm / underlying MST algorithm / following MST algorithm / tree algorithm / two algorithms / /

SocialTag