A Polynomial Algorithm for the Hamiltonian Cycle Problem in Semicomplete Multipartite Digraphs

Journal of Graph Theory - United States
doi 10.1002/(sici)1097-0118(199810)29:2<111::aid-jgt7>3.0.co;2-u
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Wiley

Related search

Hamiltonian Cycle in Complete Multipartite Graphs

Annals of Pure and Applied Mathematics
2017English

Finding Hamiltonian Cycle in Polynomial Time

Information Technology Journal
2006English

A Polynomial Algorithm for the Membership Problem With Categorial Grammars

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
1996English

A Polynomial-Time Algorithm for the Paired-Domination Problem on Permutation Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2009English

On the Parallel Complexity of the Alternating Hamiltonian Cycle Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1996English

Multipartite-Entanglement Monotones and Polynomial Invariants

Physical Review A
2012English

A Method to Search the Optimal Hamiltonian Cycle With a Set of Approximations for Travelling Salesman Problem

2015English

Hamiltonian Cayley Digraphs on Direct Products of Dihedral Groups

Open Journal of Discrete Mathematics
2012English

A Lower Bound on Cycle-Finding in Sparse Digraphs

2020English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy