Abstract
Although there exist many polynomial algorithms for NP-hard problems running on a bounded clique-width expression of the input graph, there exists only little comparable work on such algorithms for rank-width. We believe that one reason for this is the somewhat obscure and hard-to-grasp nature of rank-decompositions. Nevertheless, strong arguments for using the rank-width parameter have been given by recent formalisms independently developed by Courcelle and Kanté, by the authors, and by Bui-Xuan et al. This article focuses on designing formally clean and understandable “pseudopolynomial” (XP) algorithms solving “hard” problems (non-FPT) on graphs of bounded rank-width. Those include computing the chromatic number and polynomial or testing the Hamiltonicity of a graph and are extendable to many other problems.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Averbouch, I., Godlin, B., Makowsky, J.A., Rotics, U.: Computing graph polynomials on graphs of bounded clique-width. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol. 4271, pp. 191–204. Springer, Heidelberg (2006)
Bui-Xuan, B.-M., Telle, J.A., Vatshelle, M.: H-join and algorithms on graphs of bounded rankwidth. Technical Report 378, Dept. of Informatics, University of Bergen, Norway (2008), http://www.ii.uib.no/publikasjoner/texrap/pdf/2008-378.pdf
Corneil, D.G., Rotics, U.: On the relationship between cliquewidth and treewidth. SIAM J. Comput. 34(4), 825–847 (2005)
Courcelle, B., Kanté, M.M.: Graph Operations Characterizing Rank-Width and Balanced Graph Expressions. In: Brandstädt, A., Kratsch, D., Müller, H. (eds.) WG 2007. LNCS, vol. 4769, pp. 66–75. Springer, Heidelberg (2007)
Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst. 33(2), 125–150 (2000)
Downey, R.G., Fellows, M.R.: Parameterized complexity. Monographs in Computer Science. Springer, New York (1999)
Espelage, W., Gurski, F., Wanke, E.: How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time. In: Brandstädt, A., Van Bang Le (eds.) WG 2001. LNCS, vol. 2204, pp. 117–128. Springer, Heidelberg (2001)
Fellows, M.R., Rosamond, F.A., Rotics, U., Szeider, S.: Clique-width minimization is NP-hard. In: Proceedings of the 38th annual ACM Symposium on Theory of Computing, pp. 354–362. ACM Press, New York (2006)
Fomin, F., Golovach, P., Lokshtanov, D., Saurabh, S.: Clique-width: On the Price of Generality. In: roceedings of the 19th Annual ACM–SIAM Symposium on Discrete Algorithms, pp. 825–834. ACM Press, New York (2009)
Ganian, R.: Automata formalization for graphs of bounded rank-width. Master thesis. Faculty of Informatics of the Masaryk University, Brno, Czech republic (2008)
Ganian, R., Hliněný, P.: Automata approach to graphs of bounded rank-width. In: Proceedings of IWOCA 2008, pp. 4–15 (2008)
Ganian, R., Hliněný, P.: On Parse Trees and Myhill–Nerode–type Tools for handling Graphs of Bounded Rank-width, p. 28 (2009) (manuscript)
Gerber, M.U., Kobler, D.: Algorithms for vertex-partitioning problems on graphs with fixed clique-width. Theoret. Comput. Sci. 299(1-3), 719–734 (2003)
Gimenez, O., Hliněný, P., Noy, M.: Computing the Tutte Polynomial on Graphs of Bounded Clique-Width. SIAM J. Discrete Math. 20, 932–946 (2006)
Goldman, J., Rota, G.-C.: The number of subspaces of a vector space. In: Tutte, W.T. (ed.) Recent Progress in Combinatorics, pp. 75–83. Academic Press, London (1969)
Hliněný, P.: Branch-width, parse trees, and monadic second-order logic for matroids. J. Combin. Theory Ser. B 96(3), 325–351 (2006)
Hliněný, P., Oum, S.: Finding Branch-decomposition and Rank-decomposition. SIAM J. Comput. 38, 1012–1032 (2008)
Kanté, M.: The rank-width of directed graphs. arXiv:0709.1433v3 (2008)
Kobler, D., Rotics, U.: Edge dominating set and colorings on graphs with fixed clique-width. Discrete Appl. Math. 126(2-3), 197–221 (2003)
Oum, S., Seymour, P.: Approximating clique-width and branch-width. J. Combin. Theory Ser. B 96(4), 514–528 (2006)
Rao, M.: MSOL partitioning problems on graphs of bounded treewidth and clique-width. Theoretical Computer Science 377, 260–267 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ganian, R., Hliněný, P. (2009). Better Polynomial Algorithms on Graphs of Bounded Rank-Width. In: Fiala, J., Kratochvíl, J., Miller, M. (eds) Combinatorial Algorithms. IWOCA 2009. Lecture Notes in Computer Science, vol 5874. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10217-2_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-10217-2_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10216-5
Online ISBN: 978-3-642-10217-2
eBook Packages: Computer ScienceComputer Science (R0)