Finding minimal branchings with a given number of arcs
Yugoslav Journal of Operations Research · 2002
DOI: 10.2298/yjor0201001c ↗Kurz gefasst
Fachartikel in der Zeitschrift Yugoslav Journal of Operations Research, 2002. Verfasst von Dragos Cvetkovic und 1 weiteren Autor:innen. Die Arbeit nennt 2 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-SA 4.0).
Abstract (Originalsprache)
We describe an algorithm for finding a minimal s-branching (where s is a given number of its arcs) in a weighted digraph with an a symetric weight matrix. The algorithm uses the basic principles of the method (previously developed by J. Edmonds) for determining a minimal branching in the case when the number of its arcs is not specified in advance. Here we give a proof of the correctness for the described algorithm.
Zitieren
APA
Cvetkovic, D., & Cangalovic, M. (2002). Finding minimal branchings with a given number of arcs. Yugoslav Journal of Operations Research. https://doi.org/10.2298/yjor0201001c
Vancouver
Cvetkovic D, Cangalovic M. Finding minimal branchings with a given number of arcs. Yugoslav Journal of Operations Research. 2002. doi:10.2298/yjor0201001c
BibTeX
@article{Cvetkovic2002,
author = {Cvetkovic, Dragos and Cangalovic, Mirjana},
title = {Finding minimal branchings with a given number of arcs},
journal = {Yugoslav Journal of Operations Research},
year = {2002},
doi = {10.2298/yjor0201001c}
}
EUVIMED