Computing rank-width exactly
From MaRDI portal
Publication:989474
DOI10.1016/J.IPL.2009.03.018zbMATH Open1197.05151OpenAlexW2113302924MaRDI QIDQ989474FDOQ989474
Publication date: 20 August 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2009.03.018
Recommendations
- Rank-width: algorithmic and structural results
- Graph-Theoretic Concepts in Computer Science
- Approximating rank-width and clique-width quickly
- Directed rank-width and displit decomposition
- Computing efficiently the lattice width in any dimension
- Kolmogorov width and approximate rank
- Efficient lattice width computation in arbitrary dimension
- Computing the rank profile matrix
- The Rank-Width of the Square Grid
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12)
Cites Work
- Graph minors. X: Obstructions to tree-decomposition
- A survey of Pfaffian orientations of graphs
- Call routing and the ratcatcher
- Approximating clique-width and branch-width
- Fast multiplication of large numbers
- Title not available (Why is that?)
- Fourier meets M\"{o}bius: fast subset convolution
- Finding Branch-Decompositions and Rank-Decompositions
- Graph Drawing
- Graph-Theoretic Concepts in Computer Science
Cited In (8)
- Graph-Theoretic Concepts in Computer Science
- The carving-width of generalized hypercubes
- Bipartite entanglement in continuous variable cluster states
- Tangle bases: Revisited
- Approximating clique-width and branch-width
- Rank-width: algorithmic and structural results
- Computing efficiently the lattice width in any dimension
- The Rank-Width of the Square Grid
This page was built for publication: Computing rank-width exactly
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q989474)
