The even-path problem for graphs and digraphs (Q3345793): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1002/net.3230140403 / rank
Normal rank
 
Property / author
 
Property / author: Q197784 / rank
Normal rank
 
Property / author
 
Property / author: Christos H. Papadimitriou / 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/net.3230140403 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2007804392 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Solution to the Undirected Two Paths Problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1002/NET.3230140403 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:51, 21 December 2024

scientific article
Language Label Description Also known as
English
The even-path problem for graphs and digraphs
scientific article

    Statements

    The even-path problem for graphs and digraphs (English)
    0 references
    0 references
    1984
    0 references
    linear-time algorithm
    0 references
    even-length simple paths
    0 references
    NP-complete
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references