scientific article; zbMATH DE number 3815666

MaRDI QIDQ3663321zbMATH OpenFDO

Authors Joseph A. Wald, Charles J. Colbourn

Publication date 1982

zbMATH Keywords

planar graphsSteiner tree problemouterplanar graphs

Mathematics Subject Classification ID

Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(8)

• Computing directed Steiner path covers
• P versus NPC: minimum Steiner trees in convex split graphs
• Fast heuristic algorithms for rectilinear Steiner trees
• Improved Steiner tree algorithms for bounded treewidth
• On convexity in split graphs: complexity of Steiner tree and domination
• Steiner problem in Halin networks
• Minimum-weight two-connected spanning networks
• 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)