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

A Faster Algorithm for Computing the Principal Sequence of Partitions of a Graph

โœ Scribed by Vladimir Kolmogorov

Publisher
Springer
Year
2008
Tongue
English
Weight
811 KB
Volume
56
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A Faster Algorithm for Finding the Minim
A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
โœ J.X. Hao; J.B. Orlin ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 995 KB

We consider the problem of finding the minimum capacity cut in a directed network \(G\) with \(n\) nodes. This problem has applications to network reliability and survivability and is useful in subroutines for other network optimization problems. One can use a maximum flow problem to find a minimum

Performance of a genetic algorithm for t
Performance of a genetic algorithm for the graph partitioning problem
โœ Keiko Kohmoto; Kengo Katayama; Hiroyuki Narihisa ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 653 KB

MATHEMATICAL l OWl"lD ." \*ClaNCC d COMPUTER DIRmCT\* MODELLING Mathematical and Computer Modelling 38 (2003)