Author:
Kanté Mamadou Moustapha,Kim Eun Jung,Kwon O-joung,Paul Christophe
Funder
European Research Council
National Research Foundation of Korea (KR)
Conseil Régional Languedoc-Roussillon
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference41 articles.
1. Adler, I., Farley, A.M., Proskurowski, A.: Obstructions for linear rank-width at most 1. Discrete Appl. Math. 168, 3–13 (2014)
2. Adler, I., Kanté, M.M., Kwon, O.: Linear rank-width of distance-hereditary graphs II. Vertex-minor obstructions. preprint (2015). arXiv:1508.04718
3. Adler, I., Kanté, M.M., Kwon, O.: Linear rank-width of distance-hereditary graphs I. A polynomial-time algorithm. Algorithmica (2016). doi: 10.1007/s00453-016-0164-5
4. Bandelt, H.-J., Mulder, H.M.: Distance-hereditary graphs. J. Comb. Theory Ser. B 41(2), 182–208 (1986)
5. Bui-Xuan, B., Kanté, M.M., Limouzy, V.: A note on graphs of linear rank-width 1. preprint (2013). arXiv:1306.1345
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献