"A Polynomial-Time Algorithm for Finding a Spanning Tree with Non-Terminal ..."

Shin-ichi Nakayama, Shigeru Masuyama (2022)

> Home

Details and statistics

DOI: 10.1587/TRANSINF.2021EDP7175

access: closed

type: Journal Article

metadata version: 2023-05-11

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ieicetd/NakayamaM22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ieicetd/NakayamaM22
Shin-ichi Nakayama, Shigeru Masuyama:
A Polynomial-Time Algorithm for Finding a Spanning Tree with Non-Terminal Set V_NT on Circular-Arc Graphs. IEICE Trans. Inf. Syst. 105-D(8): 1373-1382 (2022)

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.