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

An algorithm for reliability analysis of planar graphs

โœ Scribed by Daniel Blenstock

Publisher
John Wiley and Sons
Year
1986
Tongue
English
Weight
573 KB
Volume
16
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An algorithm for drawing planar graphs
An algorithm for drawing planar graphs
โœ Bor Plestenjak ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 382 KB ๐Ÿ‘ 2 views

A simple algorithm for drawing 3-connected planar graphs is presented. It is derived from the Fruchterman and Reingold spring embedding algorithm by deleting all repulsive forces and fixing vertices of an outer face. The algorithm is implemented in the system for manipulating discrete mathematical s

An algorithm for straight-line represent
An algorithm for straight-line representation of simple planar graphs
โœ Lin Woo ๐Ÿ“‚ Article ๐Ÿ“… 1969 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 841 KB

An algorithm is developed for drawing straight-line planar graphs which are isomorphic to a convex polyhedron and simple (i.e. a connected graph with no self-loops or multiple branches). The construction of such graphs is outlined in three stages. Stage 1 determines all the independent cycles of the

Faster Shortest-Path Algorithms for Plan
Faster Shortest-Path Algorithms for Planar Graphs
โœ Monika R Henzinger; Philip Klein; Satish Rao; Sairam Subramanian ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 445 KB

We give a linear-time algorithm for single-source shortest paths in planar graphs with nonnegative edge-lengths. Our algorithm also yields a linear-time algorithm for maximum flow in a planar graph with the source and sink on the same face. For the case where negative edge-lengths are allowed, we gi