Funder
Indo-Max Planck Centre for Computer Science
Subject
General Computer Science,Theoretical Computer Science
Reference24 articles.
1. A graph-theoretic game and its application to the k-server problem;Alon;SIAM J. Comput.,1995
2. A partial k-arboretum of graphs with bounded treewidth;Bodlaender;Theoret. Comput. Sci.,1998
3. Introduction to Algorithms;Cormen,2009
4. Algorithms for generating fundamental cycles in a graph;Deo;ACM Trans. Math. Software,1982
5. Graph Theory;Diestel,2010
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Heuristic for Constructing Minimum Average Stretch Spanning Tree Using Betweenness Centrality;2022 30th Euromicro International Conference on Parallel, Distributed and Network-based Processing (PDP);2022-03
2. On Minimum Average Stretch Spanning Trees in Grid Graphs;Electronic Notes in Discrete Mathematics;2016-11