Mincut ideals of two-terminal networks
type: Item
instance of: scholarly article
title: Mincut ideals of two-terminal networks
zbMATH Open document ID: 1203.13032
author: Eduardo Saenz-de-Cabezon
author: Henry P. Wynn
published in: Applicable Algebra in Engineering, Communication and Computing
publication date: 2010-12-21T00:00:00Z
review text: The authors propose a connection between monomial ideals and networks. In the first section of the paper, they give a brief review of the theory. Section 2 provides explicit application of these ideas, and Section 3 studies it in more detail.
reviewed by: Yueh-er Kuo
Mathematics Subject Classification ID: 13P25
Mathematics Subject Classification ID: 13F55
Mathematics Subject Classification ID: 05E40
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90B25
zbMATH DE Number: 5828761
zbMATH Keywords: monomial ideals
zbMATH Keywords: minicut ideals
zbMATH Keywords: network reliability
Wikidata QID: Q60246199
MaRDI profile type: Publication
full work available at URL: s00200-010-0132-2
OpenAlex ID: W2167769013
cites work: Combinatorial aspects of network reliability
cites work: Improved Bonferroni inequalities via abstract tubes. Inequalities and identities of inclusion-exclusion type
cites work: Cohen-Macaulay clutters with combinatorial optimization properties and parallelizations of normal edge ideals
cites work: Cohen-Macaulay properties of square-free monomial ideals
cites work: Monomial ideals and the Scarf complex for coherent systems in reliability theory.
cites work: A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs
cites work: Q4888903
cites work: A Minimizing Algorithm for Sum of Disjoint Products
cites work: Properties of cut ideals associated to ring graphs
cites work: Abstract tubes, improved inclusion-exclusion identities and inequalities and importance sampling
cites work: Multigraded Betti numbers without computing minimal free resolutions
cites work: Computing the support of monomial iterated mapping cones
cites work: Betti numbers and minimal free resolutions for multi-state system reliability bounds
cites work: Computational algebraic algorithms for the reliability of generalized \(k\)-out-of-\(n\) and related systems
cites work: Combinatorics and commutative algebra.
DOI: 10.1007/S00200-010-0132-2
DBLP publication ID: journals/aaecc/Saenz-de-CabezonW10
description: scientific article; zbMATH DE number 5828761