scientific article; zbMATH DE number 1420748

MaRDI QIDQ4944807zbMATH OpenFDO

Authors Wenhua Hou

Publication date 22 March 2000

zbMATH Keywords

algorithmalternating sequencesarborescencesdigraphmatroids

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27)

Recommendations

• On the \(K\) shortest path trees problem
• Blocking optimal k-arborescences
• Finding the k Shortest Paths
• Counting minimum weight arborescences
• An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs

Cited in

(4)

• ALGORITHM FOR EXTERNAL ARGUMENTS CALCULATION OF THE NODES OF A SHRUB IN THE MANDELBROT SET
• Blocking optimal k-arborescences
• Two Algorithms for Unranking Arborescences
• Finding k-secluded trees faster

This page was built for publication:

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