Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related 
Problems

Elbassioni, Khaled; Hagen, Matthias; Rauf, Imran

doi:10.1007/978-3-540-79723-4_10

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems

MPS-Authors

/persons/resource/persons44374

Elbassioni, Khaled
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45263

Rauf, Imran
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Elbassioni, K., Hagen, M., & Rauf, I. (2008). Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems. In M. Grohe, & R. Niedermeier (Eds.), Parameterized and Exact Computation (pp. 91-102). Berlin: Springer. doi:10.1007/978-3-540-79723-4_10.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-1D02-1

Abstract

There is no abstract available