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

From MaRDI portal
scientific article
Language Label Description Also known as
English
Proportionally dense subgraph of maximum size: complexity and approximation
scientific article

    Statements

    Proportionally dense subgraph of maximum size: complexity and approximation (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    6 November 2019
    0 references
    dense subgraph
    0 references
    approximation
    0 references
    complexity
    0 references
    Hamiltonian cubic graphs
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references