Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width

Pinar Heggernes, Daniel Meister, Udi Rotics. Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width. In Alexander S. Kulikov, Nikolay K. Vereshchagin, editors, Computer Science - Theory and Applications - 6th International Computer Science Symposium in Russia, CSR 2011, St. Petersburg, Russia, June 14-18, 2011. Proceedings. Volume 6651 of Lecture Notes in Computer Science, pages 233-246, Springer, 2011. [doi]

Abstract

Abstract is missing.