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

Minimal Expansions in Redundant Number Systems and Shortest Paths in Graphs

โœ Scribed by C. Heuberger

Publisher
Springer Vienna
Year
1999
Tongue
English
Weight
79 KB
Volume
63
Category
Article
ISSN
0010-485X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

Cycles and paths in graphs with large mi
Cycles and paths in graphs with large minimal degree
โœ V. Nikiforov; R. H. Schelp ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 114 KB ๐Ÿ‘ 1 views

## Abstract Let __G__ be a simple graph of order __n__ and minimal degree >โ€‰cn (0โ€‰<โ€‰cโ€‰<โ€‰1/2). We prove that (1) There exist __n__~0~โ€‰=โ€‰__n__~0~(__c__) and __k__โ€‰=โ€‰__k__(__c__) such that if __n__โ€‰>โ€‰__n__~0~ and __G__ contains a cycle __C__~__t__~ for some __t__โ€‰>โ€‰2__k__, then __G__ contains a cycle