Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Decomposing a Graph into Shortest Paths with Bounded Eccentricity."

Etienne Birmelé et al. (2017)

> Home

Details and statistics

DOI: 10.4230/LIPICS.ISAAC.2017.15

access: open

type: Conference or Workshop Paper

metadata version: 2018-08-23

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/isaac/BirmeleMPV17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaac/BirmeleMPV17
Etienne Birmelé, Fabien de Montgolfier, Léo Planche, Laurent Viennot:
Decomposing a Graph into Shortest Paths with Bounded Eccentricity. ISAAC 2017: 15:1-15:13

a service of

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.