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

A fast randomized algorithm for partitioning a graph into paths of fixed length

โœ Scribed by Leen Stougie

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
652 KB
Volume
42
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Partitions of a graph into paths with pr
Partitions of a graph into paths with prescribed endvertices and lengths
โœ Hikoe Enomoto; Katsuhiro Ota ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 95 KB ๐Ÿ‘ 3 views

For a graph G, let ' 2 (G ) denote the minimum degree sum of a pair of nonadjacent vertices. We conjecture that if |V(G)| n i 1 k a i and ' 2 (G ) ! n k ร€ 1, then for any k vertices v 1 , v 2 , F F F , v k in G, there exist vertex-disjoint paths P 1 , P 2 , F F F , P k such that |V (P i )| a i and v

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)

A simulated annealing algorithm with the
A simulated annealing algorithm with the random compound move for the sequential partitioning problem of directed acyclic graphs
โœ Taichi Kaji; Azuma Ohuchi ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 240 KB

In this paper, we present an approach for ยฎnding a minimum cost partition of the nodes of a directed acyclic graph into subsets of a given size, subject to the constraint that the precedence relationships among the elements are satisยฎed, based on the concept of simulated annealing. Simulated anneali