Connectivity calculus
type: Item
instance of: scholarly article
title: Connectivity calculus
zbMATH Open document ID: 1039.05059
DOI: 10.1016/S0893-9659(03)80063-0
author: Dietmar Cieslik
author: Andreas W. M. Dress
author: Katharina T. Huber
author: Vincent Moulton
published in: Applied Mathematics Letters
publication date: 2004-06-11T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C65
zbMATH DE Number: 2073795
zbMATH Keywords: Steiner's problem
zbMATH Keywords: Hypergraph
zbMATH Keywords: Connected component
zbMATH Keywords: Hierarchy
zbMATH Keywords: Möbius inversion
MaRDI profile type: Publication
cites work: Embedding complexity and discrete optimization. I: A new divide and conquer approach to discrete optimization
cites work: Steiner minimal trees
cites work: Steiner's problem in graphs and its implications
cites work: The Steiner tree problem
cites work: Q4398376
full work available at URL: s0893-9659(03)80063-0
OpenAlex ID: W4210414556
description: scientific article; zbMATH DE number 2073795