Graph Operations Characterizing Rank-Width and Balanced Graph Expressions-Reference-Cited by-同舟云学术

Graph Operations Characterizing Rank-Width and Balanced Graph Expressions

Published:2007 Issue: Volume: Page:66-75
ISSN:0302-9743
Container-title:Graph-Theoretic Concepts in Computer Science
language:
Short-container-title:

Author:

Courcelle Bruno,Kanté Mamadou Moustapha

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-74839-7_7

Reference18 articles.

1. Lecture Notes in Computer Science;H.L. Bodlaender,1989

2. Bodlaender, H.L., Hagerup, T.: Parallel algorithms with optimal speedup for bounded tree-width. SIAM J. Comput. 27, 1725–1746 (1998)

3. Blumensath, A., Courcelle, B.: Recognizability, hypergraph operations and logical types. Information and Computation 204, 853–919 (2006)

4. Courcelle, B., Kanté, M.M.: Multiple Colorings : graph operations characterizing rank-width and balanced graph expressions. Available on http://www.labri.fr/perso/courcell/courcelle_kante07.pdf

5. Courcelle, B., Kanté, M.M.: Balanced Graph Expressions, manuscript (2007)

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

1. Almost-Linear Time Parameterized Algorithm for Rankwidth via Dynamic Rankwidth;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

2. Parameterized Approximation Schemes Using Graph Widths;Automata, Languages, and Programming;2014

3. Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory;Lecture Notes in Computer Science;2011

4. Constrained-Path Labellings on Graphs of Bounded Clique-Width;Theory of Computing Systems;2009-05-28

5. Better Polynomial Algorithms on Graphs of Bounded Rank-Width;Lecture Notes in Computer Science;2009