The balanced connected subgraph problem (Q5918764): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1016/j.dam.2020.12.030 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2020.12.030 / rank
 
Normal rank

Latest revision as of 09:04, 28 December 2024

scientific article; zbMATH DE number 7115816
Language Label Description Also known as
English
The balanced connected subgraph problem
scientific article; zbMATH DE number 7115816

    Statements

    The balanced connected subgraph problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    4 August 2022
    0 references
    10 October 2019
    0 references
    balanced connected subgraph
    0 references
    trees
    0 references
    split graphs
    0 references
    chordal graphs
    0 references
    planar graphs
    0 references
    bipartite graphs
    0 references
    NP-hardness
    0 references
    polynomial algorithms
    0 references
    color-balanced
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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