"Solving the maximum internal spanning tree problem on interval graphs in ..."

Xingfu Li et al. (2018)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2017.09.017

access: closed

type: Journal Article

metadata version: 2022-01-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tcs/LiFJZ18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/LiFJZ18
Xingfu Li, Haodi Feng, Haitao Jiang, Binhai Zhu:
Solving the maximum internal spanning tree problem on interval graphs in polynomial time. Theor. Comput. Sci. 734: 32-37 (2018)

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.