Back to Results
First PageMeta Content
Graph connectivity / Steiner tree problem / Tree decomposition / Tree / Halin graph / Chordal graph / Graph / Path / Path decomposition / Graph theory / Planar graphs / Graph operations


Finding a Minimal Tree in a Polygon with its Medial Axis Herman J. Haverkort 
Add to Reading List

Document Date: 2003-06-20 16:00:09

Open Document

File Size: 312,11 KB

Share Result on Facebook

City

Berlin / Stockholm / /

Company

Plenum Press / /

Country

Netherlands / /

Currency

IDR / /

/

Facility

Terminal Graphs / Clemson University / Utrecht University / /

IndustryTerm

real-life applications / tailor-made algorithm / tree algorithm / minimum network / eÆcient algorithm / linear time algorithm / polynomial time algorithm / /

NaturalFeature

S-forests / /

Organization

Clemson University / Utrecht University / /

Person

Marc van Kreveld / W. Thatcher / Hans L. Bodlaender / Herman J. Haverkort / /

Position

author / /

PublishedMedium

Lecture Notes in Computer Science / /

Technology

minimum Steiner tree algorithm / J. Algorithms / linear time algorithm / tailor-made algorithm / polynomial time algorithm / known algorithms / eÆcient algorithm / /

SocialTag