AN ALGORITHM FOR FINDING LONGEST CYCLES IN CERTAIN BIPARTITE GRAPHS (Q5249271)

From MaRDI portal
Revision as of 09:35, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6432495
Language Label Description Also known as
English
AN ALGORITHM FOR FINDING LONGEST CYCLES IN CERTAIN BIPARTITE GRAPHS
scientific article; zbMATH DE number 6432495

    Statements

    AN ALGORITHM FOR FINDING LONGEST CYCLES IN CERTAIN BIPARTITE GRAPHS (English)
    0 references
    0 references
    30 April 2015
    0 references
    bipartite graph
    0 references
    even path
    0 references
    Hamiltonian cycle
    0 references
    distance
    0 references
    degree
    0 references
    adjacency list
    0 references
    unextendable vertex
    0 references

    Identifiers