"A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum ..."

Xingfu Li et al. (2016)

> Home

Details and statistics

DOI: 10.1007/978-3-319-39817-4_10

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/faw/LiFJZ16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/faw/LiFJZ16
Xingfu Li, Haodi Feng, Haitao Jiang, Binhai Zhu:
A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs. FAW 2016: 92-101

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.