Computing rank-width exactly
type: Item
instance of: scholarly article
title: Computing rank-width exactly
zbMATH Open document ID: 1197.05151
published in: Information Processing Letters
publication date: 2010-08-20T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C12
zbMATH DE Number: 5773790
zbMATH Keywords: graph algorithms
zbMATH Keywords: rank-width
zbMATH Keywords: branch-width
zbMATH Keywords: exact exponential algorithms
zbMATH Keywords: fast subset convolution
author: Sang-Il Oum
MaRDI profile type: Publication
full work available at URL: j.ipl.2009.03.018
OpenAlex ID: W2113302924
cites work: Fourier meets M\"{o}bius: fast subset convolution
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Q3549597
cites work: Finding Branch-Decompositions and Rank-Decompositions
cites work: Graph Drawing
cites work: Approximating clique-width and branch-width
cites work: Graph minors. X: Obstructions to tree-decomposition
cites work: Fast multiplication of large numbers
cites work: Call routing and the ratcatcher
cites work: Q5491020
DOI: 10.1016/J.IPL.2009.03.018
Recommended article: Rank-width: algorithmic and structural results
Recommended article: Graph-Theoretic Concepts in Computer Science
Recommended article: Approximating rank-width and clique-width quickly
Recommended article: Directed Rank-Width and Displit Decomposition
Recommended article: Computing efficiently the lattice width in any dimension
Recommended article: Kolmogorov width and approximate rank
Recommended article: Efficient Lattice Width Computation in Arbitrary Dimension
Recommended article: Computing the rank profile matrix
Recommended article: The Rank-Width of the Square Grid
description: scientific article; zbMATH DE number 5773790