Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm (Q527431): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(4 intermediate revisions by 4 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q59889091 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963991780 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1403.1081 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transforming trees by successive local complementations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds to the clique width of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-minors, monadic second-order logic, and a conjecture by Seese / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Decomposition Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4717852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3577833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thread Graphs, Linear Rank-Width and Their Algorithmic Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance labeling scheme and split decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-width and well-quasi-ordering in matroids and graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excluding a planar graph from \(\mathrm{GF}(q)\)-representable matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Rota's Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circle graph obstructions under pivoting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear rank-width and linear clique-width of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive algorithm for path-width of matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excluded vertex-minors for graphs of linear rank-width at most \(k\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vertex separation and search number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroid Pathwidth and Code Trellis Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-width and vertex-minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rank-width of edge-coloured graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-quasi-ordering of matrices under Schur complement and applications to directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of searching a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating clique-width and branch-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3249424 / rank
 
Normal rank

Revision as of 18:40, 13 July 2024

scientific article
Language Label Description Also known as
English
Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm
scientific article

    Statements

    Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm (English)
    0 references
    0 references
    0 references
    0 references
    11 May 2017
    0 references
    rank-width
    0 references
    linear rank-width
    0 references
    distance-hereditary graphs
    0 references
    vertex-minors
    0 references
    matroid branch-width
    0 references
    matroid path-width
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references