Proportionally dense subgraph of maximum size: complexity and approximation (Q2334039)

From MaRDI portal
Revision as of 15:18, 14 September 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q127446729, #quickstatements; #temporary_batch_1726312983621)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Proportionally dense subgraph of maximum size: complexity and approximation
scientific article

    Statements

    title
    Proportionally dense subgraph of maximum size: complexity and approximation (English)
    0 references
    author
    Cristina Bazgan
    0 references
    Janka Chlebíková
    0 references
    Clément Dallard
    0 references
    Thomas Pontoizeau
    0 references
    publication date
    6 November 2019
    0 references
    zbMATH Keywords
    dense subgraph
    0 references
    approximation
    0 references
    complexity
    0 references
    Hamiltonian cubic graphs
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C42
    0 references
    05C60
    0 references
    05C45
    0 references
    68Q17
    0 references
    zbMATH DE Number
    7127268
    0 references
    OpenAlex ID
    W2929413184
    0 references
    arXiv ID
    1903.06579
    0 references
    Wikidata QID
    Q127446729
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2334039&oldid=37835188"
    Powered by MediaWiki