Charles Darwin University

CDU eSpace
Institutional Repository

 
CDU Staff and Student only
 

Parameterized Algorithms and Hardness Results for Some Graph Motif Problems

Betzler, Nadja, Fellows, Michael R., Komusiewicz, Christian and Niedermeier, Rolf (2008). Parameterized Algorithms and Hardness Results for Some Graph Motif Problems. In: CPM 2008. 19th Annual Symposium on Combinatorial Pattern Matching, Pisa, 2008.

Document type: Conference Paper
 
This record has been deleted.
Versions
Version Filter Type
Access Statistics: 162 Abstract Views, 194 File Downloads  -  Detailed Statistics
Created: Tue, 28 Feb 2012, 23:11:12 CST