Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
oaioai:HAL:hal-01494420v1

Partitioning Perfect Graphs into Stars

Authors
Publication date
1 January 2017
Publisher
Wiley
Doi

    Abstract

    International audienceThe partition of graphs into “nice” subgraphs is a central algorithmic problem with strong ties to matching theory. We study the partitioning of undirected graphs into same-size stars, a problem known to be NP-complete even for the case of stars on three vertices. We perform a thorough computational complexity study of the problem on subclasses of perfect graphs and identify several polynomial-time solvable cases, for example, on interval graphs and bipartite permutation graphs, and also NP-complete cases, for example, on grid graphs and chordal graphs

    Similar works

    Full text

    thumbnail-image

    HAL-Ecole des Ponts ParisTech

    redirect
    oaioai:HAL:hal-01494420v1
    Last time updated on 05/12/2017

    This paper was published in HAL-Ecole des Ponts ParisTech.

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.