Greedily finding a dense subgraph (Q5054810)

From MaRDI portal
Revision as of 23:04, 15 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7631752
Language Label Description Also known as
English
Greedily finding a dense subgraph
scientific article; zbMATH DE number 7631752

    Statements

    title
    Greedily finding a dense subgraph (English)
    0 references
    author
    Yuichi Asahiro
    0 references
    Kazuo Iwama
    0 references
    Hisao Tamaki
    0 references
    Takeshi Tokuyama
    0 references
    publication date
    9 December 2022
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R10
    0 references
    05C22
    0 references
    05C42
    0 references
    05C85
    0 references
    68W40
    0 references
    zbMATH DE Number
    7631752
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5054810&oldid=9519630"
      Powered by MediaWiki