Publisher
Springer Nature Switzerland
Reference17 articles.
1. Broersma, H., Dahlhaus, E., Kloks, T.: Algorithms for the treewidth and minimum fill-in of HHD-free graphs. In: International Workshop on Graph-Theoretic Concepts in Computer Science (WG), pp. 109–117 (1997). https://doi.org/10.1007/BFb0024492
2. Chandran, L.S., Cheung, Y.K., Issac, D.: Spanning tree congestion and computation of generalized Györi-Lovász partition. In: International Colloquium on Automata, Languages, and Programming, (ICALP). LIPIcs, vol. 107, pp. 32:1–32:14 (2018). https://doi.org/10.4230/LIPIcs.ICALP.2018.32
3. Chen, J., Kleinberg, R.D., Lovász, L., Rajaraman, R., Sundaram, R., Vetta, A.: (Almost) tight bounds and existence theorems for single-commodity confluent flows. J. ACM 54(4), 16 (2007). https://doi.org/10.1145/1255443.1255444
4. Győri, E.: On division of graphs to connected subgraphs, combinatorics. In: Colloq. Math. Soc. Janos Bolyai, 1976 (1976)
5. Hoyer, A.: On the independent spanning tree conjectures and related problems. Ph.D. thesis, Georgia Institute of Technology (2019)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献