The minimum rooted-cycle cover problem

DOI10.1007/978-3-319-96151-4_10zbMATH Open1404.90109OpenAlexW2883880652MaRDI QIDQ1661868FDOQ1661868

Denis Cornaz, Youcef Magnouche

Publication date: 17 August 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-96151-4_10

zbMATH Keywords

Menger's theorem[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=K%EF%BF%BD%EF%BF%BDnig%27s+theorem&go=Go K��nig's theorem]

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: The minimum rooted-cycle cover problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1661868)