On approximating the longest path in a graph (Q679451)

From MaRDI portal
Revision as of 02:31, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/algorithmica/KargerMR97, #quickstatements; #temporary_batch_1731461124002)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On approximating the longest path in a graph
scientific article

    Statements

    title
    On approximating the longest path in a graph (English)
    0 references
    author
    G. D. S. Ramkumar
    0 references
    David R. Karger
    0 references
    Rajeev Motwani
    0 references
    published in
    Algorithmica
    0 references
    publication date
    12 November 1997
    0 references
    zbMATH Keywords
    undirected graphs
    0 references
    greedy algorithm
    0 references

    Identifiers

    DOI
    10.1007/BF02523689
    0 references
    Mathematics Subject Classification ID
    68R10
    0 references
    05C38
    0 references
    68Q17
    0 references
    68W25
    0 references
    zbMATH DE Number
    1002568
    0 references
    Wikidata QID
    Q56639263
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q679451&oldid=37891930"
    Powered by MediaWiki