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

A simple solution to the two paths problem in planar graphs

โœ Scribed by Gerhard Woeginger

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
154 KB
Volume
36
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A Simple Parallel Algorithm for the Sing
A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs
โœ Jesper L. Trรคff; Christos D. Zaroliagis ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 216 KB

We present a simple parallel algorithm for the single-source shortest path problem in planar digraphs with nonnegative real edge weights. The algorithm runs on the EREW PRAM model of parallel computation in O((n 2= +n 1&= ) log n) time, performing O(n 1+= log n) work for any 0<=<1ร‚2. The strength of

The solution to an extremal problem on b
The solution to an extremal problem on balanced extensions of graphs
โœ A. Ruciล„ski; A. Vince ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 694 KB

## Abstract For __n__ sufficiently large the order of a smallest balanced extension of a graph of order __n__ is, in the worst case, โŒŠ(__n__ + 3)^2^/8โŒ‹. ยฉ 1993 John Wiley & Sons, Inc.