𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient algorithms for finding the (k, l)-core of tree networks

✍ Scribed by Ronald I. Becker; Isabella Lari; Giovanni Storchi; Andrea Scozzari

Publisher
John Wiley and Sons
Year
2002
Tongue
English
Weight
131 KB
Volume
40
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Efficient Algorithms for Finding a Core
Efficient Algorithms for Finding a Core of a Tree with a Specified Length
✍ Shietung Peng; Win-tsung Lo πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 176 KB

A core of a graph G is a path P in G that is central with respect to the property to path P. This paper presents efficient algorithms for finding a core of a tree with Ε½ . a specified length. The sequential algorithm runs in O n log n time, where n is the Ε½ 2 . Ε½. size of the tree. The parallel alg

A Genetic Algorithm for Finding the Page
A Genetic Algorithm for Finding the Pagenumber of Interconnection Networks
✍ Nidhi Kapoor; Mark Russell; Ivan Stojmenovic; Albert Y. Zomaya πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 151 KB

A ''book-embedding'' of a graph G comprises embedding the graph's nodes along the spine of a book and embedding the edges on the pages so that the edges embedded on the same page do not intersect. This is also referred to as the page model. The ''pagenumber'' of a graph is the thickness of the small

Efficient Algorithms for Finding the Max
Efficient Algorithms for Finding the Maximum Number of Disjoint Paths in Grids
✍ Wun-Tat Chan; Francis Y.L. Chin πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 366 KB

In a rectangular grid, given two sets of nodes, S S sources and T T sinks , of size 2 Ε½ . each, the disjoint paths DP problem is to connect as many nodes in S S to the Ε½ nodes in T T using a set of ''disjoint'' paths. Both edge-disjoint and Β¨ertex-disjoint . cases are considered in this paper. Note