Author:
Ducoffe Guillaume,Legay Sylvain,Nisse Nicolas
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference39 articles.
1. Abu-Ata, M., Dragan, F.: Metric tree-like structures in real-world networks: an empirical study. Networks 67, 49–68 (2016)
2. Andrade, J., Herrmann, H., Andrade, R., da Silva, L.: Apollonian networks: simultaneously scale-free, small world, Euclidean, space filling, and with matching graphs. Phys. Rev. Lett. 94, 018702 (2005)
3. Arnborg, S., Corneil, D., Proskurowski, A.: Complexity of finding embeddings in a $$k$$-tree. SIAM J. Algebraic Discrete Methods 8(2), 277–284 (1987)
4. Belmonte, R., Fomin, F.V., Golovach, P.A., Ramanujan, M.S.: Metric dimension of bounded tree-length graphs. SIAM J. Discrete Math. 31(2), 1217–1243 (2017)
5. Berry, A., Pogorelcnik, R., Sigayret, A.: Vertical decomposition of a lattice using clique separators. In: CLA’11, Nancy, France, pp. 15–29 (2011)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Treelength of series–parallel graphs;Discrete Applied Mathematics;2023-12
2. Additive tree O(ρlogn)-spanners from tree breadth ρ;Theoretical Computer Science;2022-05
3. Pathlength of Outerplanar Graphs;LATIN 2022: Theoretical Informatics;2022
4. Treelength of Series-parallel Graphs;Procedia Computer Science;2021