scientific article; zbMATH DE number 3815666
From MaRDI portal
Publication:3663321
zbMATH Open0516.05021MaRDI QIDQ3663321FDOQ3663321
Authors: Joseph A. Wald, Charles J. Colbourn 
Publication date: 1982
Title of this publication is not available (Why is that?)
Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cited In (8)
- Fast heuristic algorithms for rectilinear Steiner trees
- Computing directed Steiner path covers
- Minimum-weight two-connected spanning networks
- Improved Steiner tree algorithms for bounded treewidth
- Steiner problem in Halin networks
- P versus NPC: minimum Steiner trees in convex split graphs
- On convexity in split graphs: complexity of Steiner tree and domination
- Revising Johnson's table for the 21st century
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 Q3663321)
