Minimum cost edge subset covering exactly \(k\) vertices of a graph

DOI10.1023/A:1011457225589zbMath1078.90063OpenAlexW1493981075MaRDI QIDQ5952317

Ján Plesník

Publication date: 2001

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1011457225589

zbMATH Keywords

polynomial algorithmedge cover

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Edge covering problem under hybrid uncertain environments ⋮ Heuristics for automated knowledge source integration and service composition ⋮ Fuzzy minimum weight edge covering problem

This page was built for publication: Minimum cost edge subset covering exactly \(k\) vertices of a graph