Connectivity calculus

DOI10.1016/S0893-9659(03)80063-0zbMath1039.05059OpenAlexW4210414556MaRDI QIDQ1431949

Dietmar Cieslik, Vincent L. Moulton, Katharina T. Huber, Andreas W. M. Dress

Publication date: 11 June 2004

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0893-9659(03)80063-0

zbMATH Keywords

Möbius inversionHierarchyConnected componentHypergraphSteiner's problem

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Cites Work

• Unnamed Item
• The Steiner tree problem
• Steiner minimal trees
• Embedding complexity and discrete optimization. I: A new divide and conquer approach to discrete optimization
• Steiner's problem in graphs and its implications

This page was built for publication: Connectivity calculus