𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Statistical effectiveness of algorithms solving one problem of graph vertex partitioning

✍ Scribed by K. V. Shakhbazyan; T. A. Tushkina

Publisher
Springer US
Year
1978
Tongue
English
Weight
651 KB
Volume
13
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Algorithms for vertex-partitioning probl
Algorithms for vertex-partitioning problems on graphs with fixed clique-width
✍ Michael U. Gerber; Daniel Kobler πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 189 KB

Many vertex-partitioning problems can be expressed within a general framework introduced by Telle and Proskurowski. They showed that optimization problems in this framework can be solved in polynomial time on classes of graphs with bounded tree-width. In this paper, we consider a very similar framew

Note on vertex-partitions of infinite gr
Note on vertex-partitions of infinite graphs
✍ JΓ‘nos Pach; Joel H. Spencer πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 118 KB

Given an infinite graph G, let deg,(G) be defined as the smallest d for which V(G) can be partitioned into finite subsets of (uniformly) bounded size such that each part is adjacent to at most d others. A countable graph G is constructed with de&(G) > 2 and with the property that [{y~V(G):d(x, y)sn}

On vertex k-partitions of certain infini
On vertex k-partitions of certain infinite graphs
✍ Douglas Cenzer; Edward Howorka πŸ“‚ Article πŸ“… 1978 πŸ› Elsevier Science 🌐 English βš– 826 KB

Let G be an infinite graph; define de& G to be the least m such that any partition P of the vertex set of G into sets of uniformly bounded cardinality contains a set which is adjacent to at least m Other sets of the partition. If G is either a regular tree 01 a triangtiisr, sqzart or hexagonal plana

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)