Complexity of finding dense subgraphs (Q1613384)

From MaRDI portal
Revision as of 15:22, 4 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Complexity of finding dense subgraphs
scientific article

    Statements

    title
    Complexity of finding dense subgraphs (English)
    0 references
    author
    Yuichi Asahiro
    0 references
    Refael Hassin
    0 references
    Kazuo Iwama
    0 references
    publication date
    29 August 2002
    0 references
    zbMATH Keywords
    regular graph
    0 references
    dense subgraph problem
    0 references

    Identifiers

    zbMATH DE Number
    1792330
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1613384&oldid=34316177"
    Powered by MediaWiki