Thek best spanning arborescences of a network

DOI10.1002/net.3230100202zbMath0435.68050OpenAlexW2049751268MaRDI QIDQ3875356

Francesco Maffioli, Luigi Fratta, Paolo M. Camerini

Publication date: 1980

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230100202

zbMATH Keywords

spanning arborescences

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Related Items

Most and least uniform spanning trees, A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships, Finding the k smallest spanning trees, A note on \(K\) best network flows, Combinatorial algorithms for DNA sequence assembly, The Kth TSP is pseudopolynomial when TSP is polynomial, Ranking arborescences in O(Km log n) time, A distributed algorithm for directed minimum-weight spanning tree, Contrasting the Spread of Misinformation in Online Social Networks, An approach for the Steiner problem in directed graphs, An additive bounding procedure for the asymmetric travelling salesman problem, Finding the \(k\) smallest spanning trees, Enumerating the \(k\) best plane spanning trees, A note on finding optimum branchings, Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems, Some basic exchange properties in combinatorial optimization and their application to constructing the k-best solutions

Cites Work

• Efficiency of a Good But Not Linear Set Union Algorithm
• Unnamed Item