๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Computing All Small Cuts in an Undirected Network

โœ Scribed by Nagamochi, Hiroshi; Nishimura, Kazuhiro; Ibaraki, Toshihide

Book ID
118198112
Publisher
Society for Industrial and Applied Mathematics
Year
1997
Tongue
English
Weight
321 KB
Volume
10
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Parametric analysis of overall min-cuts
Parametric analysis of overall min-cuts and applications in undirected networks
โœ Y.P. Aneja; R. Chandrasekaran; K.P.K. Nair ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 211 KB

The overall min-cut problem in a capacitated undirected network is well known. Recently Stoer and Wagner gave an elegant algorithm for finding such a cut. In this paper we present a parametric analysis of such a cut where the capacity of an arc {i, j } in the network is given by min{b ij , ฮป}, where

Algorithm 457: finding all cliques of an
Algorithm 457: finding all cliques of an undirected graph
โœ Bron, Coen; Kerbosch, Joep ๐Ÿ“‚ Article ๐Ÿ“… 1973 ๐Ÿ› Association for Computing Machinery ๐ŸŒ English โš– 442 KB

## Description bttroductian. A maximal complete subgraph (clique) is a complete subgraph that is not contained in any other complete subgraph. A recent paper [1] describes a number of techniques to find maximal complete subgraphs of a given undirected graph. In this paper, we present two backtrack