Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm

DOI10.1007/s00453-016-0164-5zbMath1361.05036arXiv1403.1081WikidataQ59889091 ScholiaQ59889091MaRDI QIDQ527431

O-joung Kwon, Isolde Adler, Mamadou Moustapha Kanté

Publication date: 11 May 2017

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1403.1081

zbMATH Keywords

distance-hereditary graphs; linear rank-width; rank-width; matroid branch-width; matroid path-width; vertex-minors

Mathematics Subject Classification ID

52B40: Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.)

68R10: Graph theory (including graph drawing) in computer science

05C38: Paths and cycles

05B35: Combinatorial aspects of matroids and geometric lattices

05C83: Graph minors

05C12: Distance in graphs