Edge-disjoint packing of stars and cycles
type: Item
instance of: scholarly article
title: Edge-disjoint packing of stars and cycles
zbMATH Open document ID: 1344.68097
author: Ge Xia
author: Yong Zhang
author: Minghui Jiang
published in: Theoretical Computer Science
publication date: 2016-07-05T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6600961
zbMATH Keywords: graph packing
zbMATH Keywords: parameterized complexity
zbMATH Keywords: kernelization
MaRDI profile type: Publication
full work available at URL: j.tcs.2016.06.001
OpenAlex ID: W2538915965
cites work: Polynomial-time data reduction for dominating set
cites work: Color-coding
cites work: (Meta) Kernelization
cites work: Kernelization Lower Bounds by Cross-Composition
cites work: Kernel bounds for disjoint cycles and disjoint paths
cites work: Kernels for Packing and Covering Problems
cites work: Randomized Divide-and-Conquer: Improved Path, Matching, and Packing Algorithms
cites work: Fundamentals of parameterized complexity
cites work: On the complexity of partitioning graphs into connected subgraphs
cites work: A generalization of Nemhauser and Trotter's local optimization theorem
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Faster fixed-parameter tractable algorithms for matching and packing problems
cites work: Bidimensionality and Geometric Graphs
cites work: Linear Problem Kernels for NP-Hard Problems on Planar Graphs
cites work: Edge-packing in planar graphs
cites work: The NP-Completeness of Some Edge-Partition Problems
cites work: Bin packing with fixed number of bins revisited
cites work: Chain packing in graphs
cites work: Parameterized and Exact Computation
cites work: A Problem Kernelization for Graph Packing
cites work: Looking at the stars
cites work: An Improved Parameterized Algorithm for a Generalized Matching Problem
cites work: On a generalization of Nemhauser and Trotter's local optimization theorem
cites work: Towards optimal kernel for edge-disjoint triangle packing
DOI: 10.1016/J.TCS.2016.06.001
description: scientific article