Results 271 to 280 of about 1,157,729 (290)

The Pizza-Cutter’s Problem and Hamiltonian Paths

Mathematics Magazine, 2019
Summary. The pizza-cutter’s problem is to determine the maximum number of pieces that can be made with n straight cuts through a circular pizza, regardless of the size and shape of the pieces.
Baril, Jean-Luc, Moreira dos Santos, Céline   +1 more
openaire   +1 more source

Finding Hamiltonian paths in tournaments on clusters

Cluster Computing, 2006
This paper presents a general methodology for the communication-efficient parallelization of graph algorithms using the divide-and-conquer approach and shows that this class of problems can be solved in cluster environments with good communication efficiency. Specifically, the first practical parallel algorithm, based on a general coarse-grained model,
Chun-Hsi Huang, Sanguthevar Rajasekaran, Laurence Tianruo Yang, Xin He 0005   +3 more
openaire   +1 more source

Finding an Oriented Hamiltonian Path in a Tournament

Journal of Algorithms, 2000
Summary: We present an \(O(n^2)\) algorithm for finding a specified oriented path of order at least \(n\) in a tournament of order \(n\). Using this algorithm, we present an \(O(n^2)\) algorithm that finds a specified oriented path from a given vertex if one exists.
openaire   +2 more sources

Hamiltonian Paths and Cycles

2013
In this chapter, the concepts of Hamiltonian paths and Hamiltonian cycles are discussed. In the first section, the history of Hamiltonian graphs is described, and then some concepts such as Hamiltonian paths, Hamiltonian cycles, traceable graphs, and Hamiltonian graphs are defined.
Mahtab Hosseininia, Faraz Dadgostari
openaire   +1 more source

Hamiltonian and Eulerian Paths

1983
March 14. Hamiltonian and Eulerian paths and cycles come under the general heading of “de Bruijn sequences”. The specific terms “Hamiltonian” and “Eulerian” are somewhat better known; hence this chapter has been named after them rather than de Bruijn.
George Pólya, Robert E. Tarjan, Donald R. Woods   +2 more
openaire   +1 more source

Expected Computation Time for Hamiltonian Path problem

SIAM Journal on Computing, 1987
Yuri Gurevich, Saharon Shelah
exaly  

A sharp Ore-type condition for a connected graph with no induced star to have a Hamiltonian path

Discrete Applied Mathematics, 2020
Jinha Kim, Ilkyoo Choi
exaly  

Hamiltonian Path

2008
openaire   +1 more source

The Fault-Tolerant Hamiltonian Problems of Crossed Cubes with Path Faults

IEICE Transactions on Information and Systems, 2015
Tzu-Liang Kung
exaly  

A new light-based solution to the Hamiltonian path problem

Future Generation Computer Systems, 2013
Saeed Jalili, Javad Salimi Sartakhti
exaly