Arborescence optimization problems solvable by Edmonds' algorithm

DOI10.1016/S0304-3975(02)00888-5zbMath1022.68097MaRDI QIDQ1399999

Leonidas Georgiadis

Publication date: 30 July 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Bottleneckarborescencelexicographically optimal arborescenceminimum arborescenceminimum directed spanning treewidest-minimum spanning tree

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (6)

A new approach for the multiobjective minimum spanning tree ⋮ On the probabilistic min spanning tree problem ⋮ Reconfiguration of time-respecting arborescences ⋮ Unnamed Item ⋮ Quadratic bottleneck problems ⋮ Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding

Cites Work

• Unnamed Item
• Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
• The Min-Max Spanning Tree Problem and some extensions
• Algorithms for two bottleneck optimization problems
• A note on finding optimum branchings
• Finding optimum branchings
• Optimum branchings
• A simple derivation of edmonds' algorithm for optimum branchings

This page was built for publication: Arborescence optimization problems solvable by Edmonds' algorithm