"A Linear-Time Algorithm for Finding Locally Connected Spanning Trees on ..."

Ching-Chi Lin, Gen-Huey Chen, Gerard J. Chang (2013)

> Home

Details and statistics

DOI: 10.1007/S00453-012-9641-7

access: closed

type: Journal Article

metadata version: 2017-06-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/LinCC13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/LinCC13
Ching-Chi Lin, Gen-Huey Chen, Gerard J. Chang:
A Linear-Time Algorithm for Finding Locally Connected Spanning Trees on Circular-Arc Graphs. Algorithmica 66(2): 369-396 (2013)

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.