Computing rank-width exactly

Information Processing Letters

Volumn 109, Issue 13, 2009, Pages 745-748

  Oum, Sang il ^a  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

Branch width; Exact exponential algorithms; Fast subset convolution; Graph algorithms; Rank width

Indexed keywords

BRANCH-WIDTH; EXACT EXPONENTIAL ALGORITHMS; FAST SUBSET CONVOLUTION; GRAPH ALGORITHMS; RANK-WIDTH;

CONVOLUTION; DECOMPOSITION; GRAPH THEORY;

ALGORITHMS;

EID: 67349139898     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2009.03.018     Document Type: Article

References (10)

1. Björklund A., Husfeldt T., Kaski P., and Koivisto M. Fourier meets Möbius: fast subset convolution. STOC '07: Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing (2007), ACM, New York, NY, USA 67-74
2. Fomin F., Mazoit F., and Todinca I. Computing branchwidth via efficient triangulations and blocks. Discrete Appl. Math. (2008) 10.1016/j.dam.2008.08.009
3. Fürer M. Faster integer multiplication. STOC '07: Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing (2007), ACM, New York, NY, USA 57-66
4. Hliněný P., and Oum S. Finding branch-decompositions and rank-decompositions. SIAM J. Comput. 38 3 (2008) 1012-1032
5. S. Norine, Matching structure and Pfaffian orientations of graphs, PhD thesis, Georgia Institute of Technology, 2005
6. Oum S., and Seymour P. Approximating clique-width and branch-width. J. Combin. Theory Ser. B 96 4 (2006) 514-528
7. Robertson N., and Seymour P. Graph minors. X. Obstructions to tree-decomposition. J. Combin. Theory Ser. B 52 2 (1991) 153-190
8. Schönhage A., and Strassen V. Schnelle Multiplikation grosser Zahlen. Computing (Arch. Elektron. Rechnen) 7 (1971) 281-292
9. Seymour P., and Thomas R. Call routing and the ratcatcher. Combinatorica 14 2 (1994) 217-241
10. Thomas R. A survey of Pfaffian orientations of graphs. International Congress of Mathematicians vol. III (2006), Eur. Math. Soc., Zürich 963-984