An Efficient Heuristic Procedure for Partitioning Graphs (Q4100093)

From MaRDI portal
Revision as of 22:40, 2 May 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q56431136, #quickstatements; #temporary_batch_1714685954669)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 3520414
Language Label Description Also known as
English
An Efficient Heuristic Procedure for Partitioning Graphs
scientific article; zbMATH DE number 3520414

    Statements

    title
    An Efficient Heuristic Procedure for Partitioning Graphs (English)
    0 references
    publication date
    1970
    0 references

    Identifiers

    zbMATH DE Number
    3520414
    0 references
    OpenAlex ID
    W2161455936
    0 references
    Wikidata QID
    Q56431136
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4100093&oldid=34062844"
    Powered by MediaWiki