RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Tr. Inst. Mat.:
Year:
Volume:
Issue:
Page:
Find






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


Tr. Inst. Mat., 2017, Volume 25, Number 1, Pages 62–81 (Mi timb269)  

The weighted $k$-path vertex cover problem on series-parallel graphs

V. V. Lepin

Institute of Mathematics of the National Academy of Sciences of Belarus

Abstract: Given a graph $G$ with a vertex weight function $\omega_V: V(G)\to\mathbb{R}^+$ and a positive integer $k,$ we consider the weighted $k$-path vertex cover problem: it consists in finding a minimum-weight subset $S$ of vertices of a graph $G$ such that every path of order $k$ in $G$ contains at least one vertex from $S.$ We give $O(n)$ algorithms for finding the minimum weight of $k$-path vertex cover and connected $k$-path vertex cover for series-parallel graphs.

Funding Agency Grant Number
Belarusian Republican Foundation for Fundamental Research Ф16РА-003


Full text: PDF file (380 kB)
References: PDF file   HTML file
UDC: 519.1
Received: 10.01.2017

Citation: V. V. Lepin, “The weighted $k$-path vertex cover problem on series-parallel graphs”, Tr. Inst. Mat., 25:1 (2017), 62–81

Citation in format AMSBIB
\Bibitem{Lep17}
\by V.~V.~Lepin
\paper The weighted $k$-path vertex cover problem on series-parallel graphs
\jour Tr. Inst. Mat.
\yr 2017
\vol 25
\issue 1
\pages 62--81
\mathnet{http://mi.mathnet.ru/timb269}


Linking options:
  • http://mi.mathnet.ru/eng/timb269
  • http://mi.mathnet.ru/eng/timb/v25/i1/p62

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Труды Института математики
    Number of views:
    This page:176
    Full text:86
    References:22

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020