Author:
Alon Noga,Fomin Fedor V.,Gutin Gregory,Krivelevich Michael,Saurabh Saket
Publisher
Society for Industrial & Applied Mathematics (SIAM)
Cited by
26 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A $$\nicefrac {4}{3}$$-Approximation for the Maximum Leaf Spanning Arborescence Problem in DAGs;Lecture Notes in Computer Science;2024
2. How heavy independent sets help to find arborescences with many leaves in DAGs;Journal of Computer and System Sciences;2023-08
3. Balanced Clustering with a Tree over Clusters;Journal of Communications Technology and Electronics;2021-12
4. Note on Dominating Set Problems;Journal of Communications Technology and Electronics;2021-12
5. Maximum Covering Subtrees for Phylogenetic Networks;IEEE/ACM Transactions on Computational Biology and Bioinformatics;2021-11-01