"Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2."

Petr A. Golovach et al. (2019)

> Home

Details and statistics

DOI: 10.1007/S00453-019-00555-Y

access: closed

type: Journal Article

metadata version: 2025-01-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/GolovachHKLP19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/GolovachHKLP19
Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Daniël Paulusma:
Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2. Algorithmica 81(7): 2795-2828 (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.