...
机译:用许多叶子扩展定向树
Department of Mathematics, Tel Aviv University, Tel Aviv 69978, Israel;
Department of Informatics, University of Bergen, POB 7803, 5020 Bergen, Norway;
Department of Computer Science, Royal Holloway, University of London, Egham, Surrey TW20 0EX, UK;
Department of Mathematics, Tel Aviv University, Tel Aviv 69978, Israel;
Department of Informatics, University of Bergen, POB 7803, 5020 Bergen, Norway;
out-branching; maximum leaf; fixed parameter tractability; rooted tree; directed graphs;
机译:在树的正方形图中以最少的叶子数生成树
机译:连通图的最小度为6的树上的叶子数的界限
机译:在K_(1,5) - 免费图中,最多6个叶子的跨越树
机译:模拟退火算法寻找多叶跨越的有向树
机译:跨越多叶树木和多图边缘着色的算法
机译:从由叶子的随机选择序列产生的子树的长度中恢复树
机译:跨越有很多叶子的定向树