ScholarLens Back to search
2007•Jisuanji gongchengRequires access

New Method for Finding All Hamiltonian Cycles in Digraph

Mou Lian-ming

Open publisher page 0 citations

Abstract

This paper introduces the new linear k-partite digraph with single jumping-off and end point.Delete-algorithm,combination-algorithm and output-algorithm are designed.The algorithms with polynomial-time to judge whether or not there is Hamiltonian cycle in the digraph and to count the Hamilton cycle are designed.The algorithm to solve all Hamilton cycles in the digraph is constructed.The algorithmic validity is validated by example.Judgment,count and output of Hamilton cycle are effectually solved.

About this research paper

What this paper is about

This paper introduces the new linear k-partite digraph with single jumping-off and end point.Delete-algorithm,combination-algorithm and output-algorithm are designed.The algorithms with polynomial-time to judge whether or not there is Hamiltonian cycle in the digraph and to count the Hamilton cycle are designed.The algorithm to solve all Hamilton cycles in the digraph is constructed.The algorithmic validity is validated by example.Judgment,count and output of Hamilton cycle are effectually solved.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This paper introduces the new linear k-partite digraph with single jumping-off and end point.Delete-algorithm,combination-algorithm and output-algorithm are designed.The algorithms with polynomial-time to judge whether or not there is Hamiltonian cycle in the digraph and to count the Hamilton cycle are designed.The algorithm to solve all Hamilton cycles in the digraph is constructed.The algorithmic validity is validated by example.Judgment,count and output of Hamilton cycle are effectually solved.

Key concepts: Digraph, Hamiltonian path, Computer science, Hamiltonian (control theory), Algorithm, Mathematics, Combinatorics, Theoretical computer science

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
New Method for Finding All Hamiltonian Cycles in Digraph — Research Paper | ScholarLens