首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Convex Realizations of Planar Linear Trees
Authors:Gusev  N S
Institution:(1) M. V. Lomonosov Moscow State University, Russia
Abstract:We prove a necessary condition for the existence of a convex realization of a planar linear tree. In the case of broken lines, it is shown that this condition is sufficient; a continuous algorithm constructing such a realization is found.
Keywords:planar trees  convex realization  minimal networks  Steiner problem
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号