Media type: E-Article Title: Lecture Notes in Computer Science: Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width Contributor: de Menibus, Benjamin Hellouin; Uno, Takeaki imprint: Springer Berlin Heidelberg, 2011 Published in: Lecture Notes in Computer Science Language: Not determined DOI: 10.1007/978-3-642-20877-5_47 ISSN: 0302-9743; 1611-3349 Origination: Footnote: