Partitioning Perfect Graphs into Stars

René van Bevern; Robert Bredereck; Laurent Bulteau; Jiehua Chen; Vincent Froese; Rolf Niedermeier; Gerhard J. Woeginger

doi:10.1002/jgt.22062

Partitioning Perfect Graphs into Stars

René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger

Результат исследования: Научные публикации в периодических изданиях › статья

3 Цитирования (Scopus)

Аннотация

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.

Язык оригинала	английский
Страницы (с-по)	297-335
Число страниц	39
Журнал	Journal of Graph Theory
Том	85
Номер выпуска	2
DOI	https://doi.org/10.1002/jgt.22062
Состояние	Опубликовано - 1 июн 2017

Доступ к документу

10.1002/jgt.22062

Link to publication in Scopus

Fingerprint Подробные сведения о темах исследования «Partitioning Perfect Graphs into Stars». Вместе они формируют уникальный семантический отпечаток (fingerprint).

Цитировать

@article{2ddc754102e944d6a790beec73461a51,

title = "Partitioning Perfect Graphs into Stars",

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.",

keywords = "generalized matching problem, graph algorithms, graph factors, graph packing, P-Partition, INTERVAL-GRAPHS, PATH PARTITION, P-3-PARTITION, ORIENTATIONS, RECOGNITION ALGORITHM, COMPLEXITY, CHORDAL GRAPHS, BIPARTITE GRAPHS",

author = "{van Bevern}, Ren{\'e} and Robert Bredereck and Laurent Bulteau and Jiehua Chen and Vincent Froese and Rolf Niedermeier and Woeginger, {Gerhard J.}",

year = "2017",

month = jun,

day = "1",

doi = "10.1002/jgt.22062",

language = "English",

volume = "85",

pages = "297--335",

journal = "Journal of Graph Theory",

issn = "0364-9024",

publisher = "Wiley-Blackwell",

number = "2",

}

Partitioning Perfect Graphs into Stars. / van Bevern, René; Bredereck, Robert; Bulteau, Laurent; Chen, Jiehua; Froese, Vincent; Niedermeier, Rolf; Woeginger, Gerhard J.

В: Journal of Graph Theory, Том 85, № 2, 01.06.2017, стр. 297-335.

Результат исследования: Научные публикации в периодических изданиях › статья

TY - JOUR

T1 - Partitioning Perfect Graphs into Stars

AU - van Bevern, René

AU - Bredereck, Robert

AU - Bulteau, Laurent

AU - Chen, Jiehua

AU - Froese, Vincent

AU - Niedermeier, Rolf

AU - Woeginger, Gerhard J.

PY - 2017/6/1

Y1 - 2017/6/1

N2 - 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.

AB - 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.

KW - generalized matching problem

KW - graph algorithms

KW - graph factors

KW - graph packing

KW - P-Partition

KW - INTERVAL-GRAPHS

KW - PATH PARTITION

KW - P-3-PARTITION

KW - ORIENTATIONS

KW - RECOGNITION ALGORITHM

KW - COMPLEXITY

KW - CHORDAL GRAPHS

KW - BIPARTITE GRAPHS

UR - http://www.scopus.com/inward/record.url?scp=84977137901&partnerID=8YFLogxK

U2 - 10.1002/jgt.22062

DO - 10.1002/jgt.22062

M3 - Article

AN - SCOPUS:84977137901

VL - 85

SP - 297

EP - 335

JO - Journal of Graph Theory

JF - Journal of Graph Theory

SN - 0364-9024

IS - 2

ER -