Finding pseudoperipheral nodes in graphs (Q797999)

From MaRDI portal
Revision as of 02:26, 12 January 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q58329999, #quickstatements; #temporary_batch_1705018876894)
scientific article
Language Label Description Also known as
English
Finding pseudoperipheral nodes in graphs
scientific article

    Statements

    title
    Finding pseudoperipheral nodes in graphs (English)
    0 references
    author
    Jan K. Pachl
    0 references
    publication date
    1984
    0 references
    Mathematics Subject Classification ID
    68R10
    0 references
    68Q25
    0 references
    05C50
    0 references
    65F50
    0 references
    zbMATH DE Number
    3870610
    0 references
    zbMATH Keywords
    sparse graph
    0 references
    SPARSPAK
    0 references
    pseudoperipheral nodes
    0 references
    worst case time complexity
    0 references
    Wikidata QID
    Q58329999
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q797999&oldid=11853812"
      Powered by MediaWiki