A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs (Q4242916): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
label / enlabel / en
 
A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs
Property / author
 
Property / author: Jörgen Bang-Jensen / rank
Normal rank
 
Property / author
 
Property / author: Jörgen Bang-Jensen / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199810)29:2<111::aid-jgt7>3.0.co;2-u / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2986504093 / rank
 
Normal rank
Property / title
 
A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs (English)
Property / title: A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs (English) / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:18, 30 July 2024

scientific article; zbMATH DE number 1286470
Language Label Description Also known as
English
A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs
scientific article; zbMATH DE number 1286470

    Statements

    0 references
    0 references
    0 references
    7 July 1999
    0 references
    Hamiltonian cycle
    0 references
    polynomial algorithm
    0 references
    semicomplete multipartite digraphs
    0 references
    multipartite tournaments
    0 references
    cycle through specified vertices
    0 references
    A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs (English)
    0 references

    Identifiers