"The complexity of two graph orientation problems."

Nicole Eggemann, Steven D. Noble (2012)

> Home

Details and statistics

DOI: 10.1016/J.DAM.2011.10.036

access: open

type: Journal Article

metadata version: 2023-03-21

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dam/EggemannN12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/EggemannN12
Nicole Eggemann, Steven D. Noble:
The complexity of two graph orientation problems. Discret. Appl. Math. 160(4-5): 513-517 (2012)

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.