Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm
type: Item
instance of: scholarly article
title: Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm
zbMATH Open document ID: 1361.05036
author: Isolde Adler
author: Mamadou Moustapha Kanté
author: O-joung Kwon
published in: Algorithmica
publication date: 2017-05-11T00:00:00Z
full work available at URL: https://arxiv.org/abs/1403.1081
full work available at URL: 16AKK.pdf
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C83
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05B35
Mathematics Subject Classification ID: 52B40
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 6714295
zbMATH Keywords: rank-width
zbMATH Keywords: linear rank-width
zbMATH Keywords: distance-hereditary graphs
zbMATH Keywords: vertex-minors
zbMATH Keywords: matroid branch-width
zbMATH Keywords: matroid path-width
Wikidata QID: Q59889091
MaRDI profile type: Publication
OpenAlex ID: W2963991780
arXiv ID: 1403.1081
cites work: Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions
cites work: Distance-hereditary graphs
cites work: Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
cites work: Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
cites work: Transforming trees by successive local complementations
cites work: Upper bounds to the clique width of graphs
cites work: Vertex-minors, monadic second-order logic, and a conjecture by Seese
cites work: A Combinatorial Decomposition Theory
cites work: Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition
cites work: Q4717852
cites work: Q3577833
cites work: Thread Graphs, Linear Rank-Width and Their Algorithmic Applications
cites work: Distance labeling scheme and split decomposition
cites work: Branch-width and well-quasi-ordering in matroids and graphs.
cites work: Excluding a planar graph from \(\mathrm{GF}(q)\)-representable matroids
cites work: Solving Rota's conjecture
cites work: Circle graph obstructions under pivoting
cites work: Linear rank-width and linear clique-width of trees
cites work: Constructive algorithm for path-width of matroids
cites work: Excluded vertex-minors for graphs of linear rank-width at most \(k\)
cites work: The vertex separation and search number of a graph
cites work: Matroid Pathwidth and Code Trellis Complexity
cites work: Rank-width and vertex-minors
cites work: The rank-width of edge-coloured graphs
cites work: Well-quasi-ordering of matrices under Schur complement and applications to directed graphs
cites work: The complexity of searching a graph
cites work: Approximating clique-width and branch-width
cites work: Lectures on matroids
cites work: Q3249424
DOI: 10.1007/S00453-016-0164-5
description: scientific article