Mincut ideals of two-terminal networks

  1. Sáenz-De-Cabezón, E. 2
  2. Wynn, H.P. 1
  1. 1 London School of Economics and Political Science
    info

    London School of Economics and Political Science

    Londres, Reino Unido

    ROR https://ror.org/0090zs177

  2. 2 Universidad de La Rioja
    info

    Universidad de La Rioja

    Logroño, España

    ROR https://ror.org/0553yr311

Revista:
Applicable Algebra in Engineering, Communications and Computing

ISSN: 0938-1279

Año de publicación: 2010

Volumen: 21

Número: 6

Páginas: 443-457

Tipo: Artículo

beta Ver similares en nube de resultados
DOI: 10.1007/S00200-010-0132-2 SCOPUS: 2-s2.0-79951770201 WoS: WOS:000284228500002 GOOGLE SCHOLAR

Otras publicaciones en: Applicable Algebra in Engineering, Communications and Computing

Resumen

This paper introduces mincut ideals of two-terminal networks, which arise in the algebraic analysis of system reliability. We give the definitions and study their algebraic and combinatorial properties in some particular cases. It turns out that some features of the mincut ideals arising from networks such as the Cohen-Macaulay property and the computation of Betti numbers, which are important in tight reliability bounds, have a compact expression for series-parallel networks. This relies on a natural mapping of the structure of such networks into the union and intersection structure of the corresponding ideal. © Springer-Verlag 2010.