"NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences ..."

Sepp Hartung, André Nichterlein (2015)

> Home

Details and statistics

DOI: 10.1137/130935756

access: closed

type: Journal Article

metadata version: 2020-04-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamdm/HartungN15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamdm/HartungN15
Sepp Hartung, André Nichterlein:
NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs. SIAM J. Discret. Math. 29(4): 1931-1960 (2015)

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.