scientific article; zbMATH DE number 508831

MaRDI QIDQ4280135zbMATH OpenFDO

Authors Dorothea Wagner

Publication date 14 March 1994

zbMATH Keywords

complexityefficient algorithmslinear time algorithmpathsplanar graphSteiner tree packing

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 833766
• Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs
• Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs
• scientific article; zbMATH DE number 2079349

Cited in

(6)

• Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs
• scientific article; zbMATH DE number 139783 (Why is no real title available?)
• scientific article; zbMATH DE number 1522940 (Why is no real title available?)
• scientific article; zbMATH DE number 833766 (Why is no real title available?)
• Finding a noncrossing Steiner forest in plane graphs under a 2-face condition
• Geodesic packing in graphs

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 Q4280135)