@incollection{,
year={2011},
isbn={978-3-642-20876-8},
booktitle={Theory and Applications of Models of Computation},
volume={6648},
series={Lecture Notes in Computer Science},
editor={Ogihara, Mitsunori and Tarui, Jun},
doi={10.1007/978-3-642-20877-5_47},
title={Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width},
publisher={Springer Berlin Heidelberg},
keywords={maximal matching; path matching; counting; clique-width},
author={Menibus, BenjaminHellouin and Uno, Takeaki},
pages={483-494}
}