Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width.

Benjamin Hellouin de Menibus, Takeaki Uno

Browse the full TAMC paper archive.