Benjamin Hellouin de Menibus, Takeaki Uno. Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width. In Mitsunori Ogihara, Jun Tarui, editors, Theory and Applications of Models of Computation - 8th Annual Conference, TAMC 2011, Tokyo, Japan, May 23-25, 2011. Proceedings. Volume 6648 of Lecture Notes in Computer Science, pages 483-494, Springer, 2011. [doi]
Abstract is missing.