"The complexity of deciding whether a graph admits an orientation with ..."

Julien Bensmail, Romaric Duvignau, Sergey Kirgizov (2016)

> Home

Details and statistics

DOI: 10.46298/DMTCS.2161

access: open

type: Journal Article

metadata version: 2023-01-31

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dmtcs/BensmailDK16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dmtcs/BensmailDK16
Julien Bensmail, Romaric Duvignau, Sergey Kirgizov:
The complexity of deciding whether a graph admits an orientation with fixed weak diameter. Discret. Math. Theor. Comput. Sci. 17(3): 31-42 (2016)

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.