Better Polynomial Algorithms on Graphs of Bounded Rank-Width-Reference-Cited by-同舟云学术

Better Polynomial Algorithms on Graphs of Bounded Rank-Width

Published:2009 Issue: Volume: Page:266-277
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Ganian Robert,Hliněný Petr

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-10217-2_27.pdf

Reference21 articles.

1. Lecture Notes in Computer Science;I. Averbouch,2006

2. 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

3. Corneil, D.G., Rotics, U.: On the relationship between cliquewidth and treewidth. SIAM J. Comput. 34(4), 825–847 (2005)

4. Lecture Notes in Computer Science;B. Courcelle,2007

5. 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)

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Obstructions for linear rank-width at most 1;Discrete Applied Mathematics;2014-05

2. A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width;European Journal of Combinatorics;2013-04

3. On Edge-Independent Sets;Frontiers in Algorithmics and Algorithmic Aspects in Information and Management;2013

4. Algorithms for the Strong Chromatic Index of Halin Graphs, Distance-Hereditary Graphs and Maximal Outerplanar Graphs;Lecture Notes in Computer Science;2012

5. Thread Graphs, Linear Rank-Width and Their Algorithmic Applications;Lecture Notes in Computer Science;2011