✦ LIBER ✦

The complexity of determining a shortest cycle of even length

✍ Scribed by B. Monien

Publisher: Springer Vienna
Year: 1983
Tongue: English
Weight: 656 KB
Volume: 31
Category: Article
ISSN: 0010-485X
DOI: 10.1007/bf02251238

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The expected length of a shortest path

✍ Robert Davis; Armand Prieditis 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 568 KB

The existence of even cycles with specif

The existence of even cycles with specific lengths in Wenger’s graph

✍ Jia-yu Shao; Chang-xiang He; Hai-ying Shan 📂 Article 📅 2008 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 175 KB

Estimation and determination of shortest

Estimation and determination of shortest path length in a road network with obstacles

✍ Nicolas Dubois; Frédéric Semet 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 798 KB

The Length of the Shortest Edge of a Gra

The Length of the Shortest Edge of a Graph on a Sphere

✍ Hiroshi Maehara 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 62 KB

Let S d denote a unit sphere in the (d + 1)-dimensional Euclidean space R d+1 (d ≥ 1). For a simple graph G E with edge set E, take independent random points x k , k ∈ V (G E ), on S d , and let D E be the minimum value of the spherical distance between x i , x j for {i, j} ∈ E. We prove that , whe

The determination of the cycle length in

The determination of the cycle length in high level synthesis

✍ Ming-Hwa Sheu; Yuan-Long Jeang; Jhing-Fa Wang; Jau-Yien Lee 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 848 KB

A theorem on the expected complexity of

A theorem on the expected complexity of dijkstra's shortest path algorithm

✍ Kohei Noshita 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 433 KB