scientific article
From MaRDI portal
Publication:3663321
zbMath0516.05021MaRDI QIDQ3663321
Joseph A. Wald, Charles J. Colbourn
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)
Related Items (8)
Computing directed Steiner path covers ⋮ Steiner problem in Halin networks ⋮ Fast heuristic algorithms for rectilinear Steiner trees ⋮ Improved Steiner tree algorithms for bounded treewidth ⋮ P versus NPC: minimum Steiner trees in convex split graphs ⋮ On convexity in split graphs: complexity of Steiner tree and domination ⋮ Minimum-weight two-connected spanning networks ⋮ Revising Johnson's table for the 21st century
This page was built for publication:
