✦ LIBER ✦

A linear-time algorithm for finding Hamiltonian cycles in tournaments

✍ Scribed by Y. Manoussakis

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 285 KB
Volume: 36
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(92)90233-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fast parallel algorithms for finding ham

Fast parallel algorithms for finding hamiltonian paths and cycles in a tournament

✍ Danny Soroker 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 554 KB

Fast algorithms for finding Hamiltonian

Fast algorithms for finding Hamiltonian paths and cycles in in-tournament digraphs

✍ Jørgen Bang-Jensen; Pavol Hell 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 332 KB

A linear algorithm for finding Hamiltoni

A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs

✍ Takao Asano; Shunji Kikuchi; Nobuji Saito 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 901 KB

An Efficient Parallel Algorithm for Find

An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs

✍ M. Furer; B. Raghavachari 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 763 KB

A Linear Time Algorithm for Finding ak-T

A Linear Time Algorithm for Finding ak-Tree Core

✍ Akiyoshi Shioura; Takeaki Uno 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 173 KB

Given a tree containing n vertices, consider the sum of the distance between all Ž . vertices and a k-leaf subtree subtree which contains exactly k leaves . A k-tree core is a k-leaf subtree which minimizes the sum of the distances. In this paper, we propose a linear time algorithm for finding a k-t

A linear-time algorithm for finding opti

A linear-time algorithm for finding optimal vehicle refueling policies

✍ Shieu Hong Lin; Nate Gertsch; Jennifer R. Russell 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 148 KB