A Win/Win Algorithm for the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$(k+1) $$\end{document}-LST/\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k $$\end{document}-Pathwidth Problem

被引:0
|
作者
A. G. Klyuchikov
M. N. Vyalyi
机构
[1] Moscow Institute of Physics and Technology,
[2] Federal Research Center “Computer Science and Control,undefined
[3] National Research University “Higher School of Economics”,undefined
关键词
path decomposition; spanning tree; k-LST problem; Win/Win algorithm; FPT;
D O I
10.1134/S1990478921040062
中图分类号
学科分类号
摘要
引用
收藏
页码:627 / 630
页数:3
相关论文
共 50 条