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

From MaRDI portal
Publication:3010427

DOI10.1007/978-3-642-20877-5_47zbMath1333.05291arXiv1806.00791OpenAlexW1540768932MaRDI QIDQ3010427

Takeaki Uno, Benjamin Hellouin de Menibus

Publication date: 1 July 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1806.00791






Cites Work


This page was built for publication: Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width