NP-Hardness and fixed-parameter tractability of realizing degree sequences with directed acyclic graphs

In S. Barry Cooper (ed.), How the World Computes. pp. 283--292 (2012)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,503

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Invitation to fixed-parameter algorithms.Rolf Niedermeier - 2006 - New York: Oxford University Press.
On the complexity of Gödel's proof predicate.Yijia Chen & Jörg Flum - 2010 - Journal of Symbolic Logic 75 (1):239-254.
Dangerous Reference Graphs and Semantic Paradoxes.Landon Rabern, Brian Rabern & Matthew Macauley - 2013 - Journal of Philosophical Logic 42 (5):727-765.
Causal diagrams and change variables.Eyal Shahar & Doron J. Shahar - 2012 - Journal of Evaluation in Clinical Practice 18 (1):143-148.

Analytics

Added to PP
2014-01-28

Downloads
7 (#1,377,350)

6 months
1 (#1,479,630)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Invitation to fixed-parameter algorithms.Rolf Niedermeier - 2006 - New York: Oxford University Press.

Add more references