Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Diskretnyi Analiz i Issledovanie Operatsii, 2021, Volume 28, Issue 4, Pages 117–124
DOI: https://doi.org/10.33048/daio.2021.28.710 (Mi da1288) 		 
A win-win algorithm for the $(k+1)$-LST/$k$-pathwidth problem

A. G. Klyuchikova, M. N. Vyalyiabc

a Moscow Institute of Physics and Technology, 9 Institutskii Lane, 141701 Dolgoprudnyi, Russia
b Federal Research Center “Computer Science and Control” RAS 44 Bld. 2 Vavilov Street, 119333 Moscow, Russia
c HSE University, 11 Pokrovskii Boulevard, 109028 Moscow, Russia
Full-text PDF (306 kB)
References:
PDF
HTML
DOI: https://doi.org/10.33048/daio.2021.28.710
Abstract: We describe a win-win algorithm that produces in polynomial of size of a graph $G$ and given parameter $k$ time either a spanning tree with al least $k+1$ leaves or a path decomposition with width at most $k$. This algorithm is optimal due to the path decomposition theorem [1]. Bibliogr. 5.
Keywords: path decomposition, spanning tree, $k$-LST problem, win-win algorithm, FPT.
Funding agency Grant number
Ministry of Science and Higher Education of the Russian Federation 0063-2019-0003
The work of the second author is supported by the HSE University Program for Basic Research and carried out within the framework of the State Assignment of FRC “Computer Science and Control” RAS (Project 0063–2019–0003).
Received: 12.04.2021
Revised: 02.08.2021
Accepted: 03.08.2021
Document Type: Article
UDC: 519.178
Language: Russian
Citation: A. G. Klyuchikov, M. N. Vyalyi, “A win-win algorithm for the $(k+1)$-LST/$k$-pathwidth problem”, Diskretn. Anal. Issled. Oper., 28:4 (2021), 117–124
Citation in format AMSBIB
\Bibitem{KlyVya21}
\by A.~G.~Klyuchikov, M.~N.~Vyalyi
\paper A win-win algorithm for~the~$(k+1)$-LST/$k$-pathwidth~problem
\jour Diskretn. Anal. Issled. Oper.
\yr 2021
\vol 28
\issue 4
\pages 117--124
\mathnet{http://mi.mathnet.ru/da1288}
\crossref{https://doi.org/10.33048/daio.2021.28.710}
Linking options:
  • https://www.mathnet.ru/eng/da1288
  • https://www.mathnet.ru/eng/da/v28/i4/p117
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:154
    Full-text PDF :50
    References:15
    First page:3
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024