Università di Pisa
Sistema bibliotecario di ateneo

The MPA Graph Problem

Luccio, Fabrizio The MPA Graph Problem. Dipartimento di Informatica, Pisa. (Unpublished)

Available under License Creative Commons Attribution No Derivatives.

Download (273Kb) | Preview


    Given an undirected graph G whose vertices are associated to different subsets of colors, the MPA problem asks for partitioning G into a minimal set of monochromatic connected subgraphs. We prove that MPA is NP-hard as well as its extensions BDMPA where the vertices of G have a bounded maximum degree, PMPA where G is planar, BDPMPA where the maximum vertex degree is bounded and G is planar, and GMPA where G consists of a p by q grid.

    Item Type: Other
    Subjects: Area01 - Scienze matematiche e informatiche > INF/01 - Informatica
    Divisions: Dipartimenti (from 2013) > DIPARTIMENTO DI INFORMATICA
    Depositing User: Professor Fabrizio Luccio
    Date Deposited: 09 Jun 2018 08:09
    Last Modified: 09 Jun 2018 08:09
    URI: http://eprints.adm.unipi.it/id/eprint/2376

    Repository staff only actions

    View Item