✦ LIBER ✦

An algorithm for the determination of longest distances in a graph

✍ Scribed by Hartmut Noltemeier

Publisher: Springer-Verlag
Year: 1975
Tongue: English
Weight: 350 KB
Volume: 9
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf01681355

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A simple algorithm for enumerating longe

A simple algorithm for enumerating longest distances in the plane

✍ Matthew T. Dickerson; Jason Shugart 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 545 KB

An algorithm for the determination of a

An algorithm for the determination of a longest increasing subsequence in a sequence

✍ M. Orlowski; M. Pachter 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 171 KB

We present a simple, novel and efficient algorithm for the determination of a longest increasing subsequence in a given sequence of ,, numbers. Our algorithm performs in O(,~ log r) time in the worst case, where r is the size of the output, i.e. r is the length of the longest increasing subsequence

An algorithm to find two distance domina

An algorithm to find two distance domination parameters in a graph

✍ Gerd H. Fricke; Michael A. Henning; Ortrud R. Oellermann; Henda C. Swart 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 467 KB

An algorithm for determining the automor

An algorithm for determining the automorphism partitioning of an undirected graph

✍ D. G. Corneil 📂 Article 📅 1972 🏛 Springer Netherlands 🌐 English ⚖ 563 KB

An algorithm for determining the shortes

An algorithm for determining the shortest path on a network graph

✍ S.M. Alekseeva; O.G. Alekseev 📂 Article 📅 1971 🏛 Elsevier Science ⚖ 568 KB

An economical algorithm for distinguishi

An economical algorithm for distinguishing blocks in a graph

✍ E.A. Dinits; M.A. Zaitsev; A.V. Karzanov 📂 Article 📅 1974 🏛 Elsevier Science ⚖ 678 KB