wgqzUGB1qNHOlI9kJXpdlGPM4Te1reeOzmup02rHbdqysGRJUfPpoOhuztMt
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

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-10-22

Prev One: Isomorphism and similarity for 2-generation pedigrees.

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