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

Visibility graphs and obstacle-avoiding shortest paths

โœ Scribed by H. Alt; E. Welzl

Book ID
105401880
Publisher
Springer
Year
1988
Tongue
English
Weight
899 KB
Volume
32
Category
Article
ISSN
0340-9422

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Shortest paths on dynamic graphs
Shortest paths on dynamic graphs
โœ Giacomo Nannicini; Leo Liberti ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 746 KB
Shortest noncrossing paths in plane grap
Shortest noncrossing paths in plane graphs
โœ Junya Takahashi, Hitoshi Suzuki and Takao Nishizeki ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Springer ๐ŸŒ English โš– 569 KB
Shortest paths in fuzzy weighted graphs
Shortest paths in fuzzy weighted graphs
โœ Chris Cornelis; Peter De Kesel; Etienne E. Kerre ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 232 KB

The task of finding shortest paths in weighted graphs is one of the archetypical problems encountered in the domain of combinatorial optimization and has been studied intensively over the past five decades. More recently, fuzzy weighted graphs, along with generalizations of algorithms for finding op