Paper Publications
A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs
Release Time:2019-04-14| Hits:
Institution:计算机科学与技术学院
Title of Paper:A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs
Journal:Lecture Notes in Computer Science
First Author:Feng Haodi
All the Authors:姜海涛
Document Code:lw-183391
Volume:9711
Page Number:92
Translation or Not:No
Date of Publication:2016-06
Release Time:2019-04-14
Copyright All Rights Reserved Shandong University Address: No. 27 Shanda South Road, Jinan City, Shandong Province, China: 250100
Information desk: (86) - 0531-88395114
On Duty Telephone: (86) - 0531-88364731 Construction and Maintenance: Information Work Office of Shandong University