0vTjWu028Xzvjd3ucEHbQI770V6z8VwiquSYwsj2DDM3LoFwvmkMzGZr0Vky
Current position: Home >> Scientific Research >> Paper Publications

A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs

Hits:

Institution:计算机科学与技术学院

Title of Paper:A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs

First Author:Feng Haodi

All the Authors:姜海涛,Feng Haodi

Document Code:lw-183391

Volume:9711

Page Number:92

Number of Words:7

Translation or Not:No

Date of Publication:2016-06

Release Time:2019-10-24

Prev One:排列短块移动排序距离的新下界

Next One:A 14/11-approximation algorithm for sorting by short block moves