NC algorithms for antidirected hamiltonian paths and cycles in tournaments

Autor:	Evripidis Bampis, Yannis Mannoussakis, Ioannis Milis
Rok vydání:	1995
Předmět:	Discrete mathematics Context (language use) Mathematical proof Hamiltonian path Combinatorics symbols.namesake Cardinality Path (graph theory) symbols Tournament Algorithm Sequential algorithm Hamiltonian (control theory) MathematicsofComputing_DISCRETEMATHEMATICS Mathematics
Zdroj:	Graph-Theoretic Concepts in Computer Science ISBN: 9783540590712 WG
DOI:	10.1007/3-540-59071-4_63
Popis:	Two classical theorems about tournaments state that a tournament with no less than eight vertices admits an antidirected Hamiltonian path and an even cardinality tournament with no less than sixteen vertices admits an antidirected Hamiltonian cycle. Sequential algorithms for finding such a path as well as a cycle follow directly from the proofs of the theorems. Unfortunately, these proofs are inherently sequential and can not be exploited in a parallel context. In this paper we propose new proofs leading to efficient parallel algorithms.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::338090be8959ec53a9cdc22b06f71e66 https://doi.org/10.1007/3-540-59071-4_63 Zobrazit plný text záznamu