Optimal Hamiltonian completions and path covers for trees, and a reduction to maximum flow (Q4796447): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1017/s1446181100013894 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2169473633 / rank
 
Normal rank

Latest revision as of 10:54, 30 July 2024

scientific article; zbMATH DE number 1876728
Language Label Description Also known as
English
Optimal Hamiltonian completions and path covers for trees, and a reduction to maximum flow
scientific article; zbMATH DE number 1876728

    Statements

    Optimal Hamiltonian completions and path covers for trees, and a reduction to maximum flow (English)
    0 references
    0 references
    0 references
    11 April 2003
    0 references
    Hamiltonian path
    0 references
    minimum path cover
    0 references
    tree
    0 references
    linear time algorithm for tree maximum flow
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references