Directed Rank-Width and Displit Decomposition

DOI10.1007/978-3-642-11409-0_19zbMath1273.68280OpenAlexW1750706066MaRDI QIDQ5851107

Mamadou Moustapha Kanté, Michaël Rao

Publication date: 21 January 2010

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11409-0_19

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)

Related Items

The rank-width of edge-coloured graphs, Grammars and clique-width bounds from split decompositions, Directed elimination games, Twin-distance-hereditary digraphs, $\mathbb F$ -Rank-Width of (Edge-Colored) Graphs, Digraphs of Bounded Width, Unnamed Item