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
Attached Files (Some files may be inaccessible until you login with your CDU eSpace credentials)
Name Description MIMEType Size Downloads
Download this reading cdu9643.pdf PDF for ERA application/pdf 213.32KB 3
Reading the attached file works best in Firefox, Chrome and IE 9 or later.

IRMA ID 83093774xPUB65
Author Betzler, Nadja
Fellows, Michael R.
Komusiewicz, Christian
Niedermeier, Rolf
Title Parameterized Algorithms and Hardness Results for Some Graph Motif Problems
Conference Name CPM 2008. 19th Annual Symposium on Combinatorial Pattern Matching
Conference Location Pisa
Conference Dates 2008
Conference Publication Title Lecture Notes in Computer Science
Place of Publication Berlin
Publisher Springer-Verlag
Publication Year 2008
Volume Number 5029
Issue Number 2008
Start Page 31
End Page 43
Total Pages 12
Field of Research 0802 - Computation Theory and Mathematics


© copyright

Every reasonable effort has been made to ensure that permission has been obtained for items included in CDU eSpace. If you believe that your rights have been infringed by this repository, please contact digitisation@cdu.edu.au.

 
Versions
Version Filter Type
Access Statistics: 15 Abstract Views, 3 File Downloads  -  Detailed Statistics
Created: Tue, 28 Feb 2012, 23:11:12 CST