Author:
Adler Isolde,Kanté Mamadou Moustapha,Kwon O-joung
Funder
European Research Council (BE)
Deutsche Forschungsgemeinschaft (DE)
National Research Foundation of Korea (KR)
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference31 articles.
1. Adler, I., Kanté, Mamadou Moustapha, O-joung, K.: Linear rank-width of distance-hereditary graphs II. Vertex-minor obstructions. Submitted, (2015). http://arxiv.org/abs/1508.04718
2. Bandelt, H.J., Mulder, H.M.: Distance-hereditary graphs. J. Comb. Theory Ser. B 41(2), 182–208 (1986)
3. Bodlaender, H.L., Gilbert, J.R., Hafsteinsson, H., Kloks, T.: Approximating treewidth, pathwidth, and minimum elimination tree height. J. Algorithms 18, 238–255 (1991)
4. Bodlaender, H.L., Kloks, T.: Efficient and constructive algorithms for the pathwidth and treewidth of graphs. J. Algorithms 21(2), 358–402 (1996)
5. Bouchet, A.: Transforming trees by successive local complementations. J. Graph Theory 12(2), 195–207 (1988)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献