"Using spine decompositions to efficiently solve the length-constrained ..."

Bishnu Bhattacharyya, Frank K. H. A. Dehne (2008)

> Home

Details and statistics

DOI: 10.1016/J.IPL.2008.05.023

access: closed

type: Journal Article

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/BhattacharyyaD08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/BhattacharyyaD08
Bishnu Bhattacharyya, Frank K. H. A. Dehne:
Using spine decompositions to efficiently solve the length-constrained heaviest path problem for trees. Inf. Process. Lett. 108(5): 293-297 (2008)

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.