"A simple linear time algorithm for the locally connected spanning tree ..."

Tiziana Calamoneri, Matteo Dell'Orefice, Angelo Monti (2019)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2018.02.025

access: closed

type: Journal Article

metadata version: 2019-06-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tcs/CalamoneriDM19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/CalamoneriDM19
Tiziana Calamoneri, Matteo Dell'Orefice, Angelo Monti:
A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs. Theor. Comput. Sci. 764: 2-14 (2019)

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.