Connectivity calculus

DOI10.1016/S0893-9659(03)80063-0MaRDI QIDQ1431949zbMATH OpenOpenAlexFDO

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

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

Connected componentHierarchyHypergraphSteiner's problemMöbius inversion

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4097432
• scientific article; zbMATH DE number 850300
• On decomposing a hypergraph into \(k\) connected sub-hypergraphs
• scientific article; zbMATH DE number 3933118
• Hyper-T-width and hyper-D-width: Stable connectivity measures for hypergraphs

Cites work

• scientific article; zbMATH DE number 1175959 (Why is no real title available?)
• Embedding complexity and discrete optimization. I: A new divide and conquer approach to discrete optimization
• Steiner minimal trees
• Steiner's problem in graphs and its implications
• The Steiner tree problem

Cited in

(3)

• scientific article; zbMATH DE number 1950264 (Why is no real title available?)
• Connectivity calculus of fractal polyhedrons
• Formulas versus Circuits for Small Distance Connectivity

This page was built for publication: Connectivity calculus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1431949)