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:pure.tue.nl:openaire_cris_publications/1840b08c-8cce-429e-8bbd-568d82e9f42b

Partitioning perfect graphs into stars

Authors
Publication date
1 June 2017
Publisher
Doi

    Abstract

    The 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.</p

    Similar works

    Full text

    thumbnail-image

    Pure OAI Repository

    redirect
    oaioai:pure.tue.nl:openaire_cris_...
    Last time updated on 11/08/2023

    This paper was published in Pure OAI Repository.

    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.