Edge-disjoint packing of stars and cycles
DOI10.1016/J.TCS.2016.06.001zbMATH Open1344.68097OpenAlexW2538915965MaRDI QIDQ2629232FDOQ2629232
Authors: Ge Xia, Yong Zhang, Minghui Jiang 
Publication date: 5 July 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.06.001
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Fundamentals of parameterized complexity
- An Improved Parameterized Algorithm for a Generalized Matching Problem
- A Problem Kernelization for Graph Packing
- Color-coding
- Graph-Theoretic Concepts in Computer Science
- A generalization of Nemhauser and Trotter's local optimization theorem
- Looking at the stars
- Kernelization Lower Bounds by Cross-Composition
- (Meta) Kernelization
- Bidimensionality and Geometric Graphs
- On the complexity of partitioning graphs into connected subgraphs
- Randomized divide-and-conquer: improved path, matching, and packing algorithms
- Kernel bounds for disjoint cycles and disjoint paths
- Kernels for Packing and Covering Problems
- Polynomial-time data reduction for dominating set
- Linear Problem Kernels for NP-Hard Problems on Planar Graphs
- Faster fixed-parameter tractable algorithms for matching and packing problems
- Bin packing with fixed number of bins revisited
- On a generalization of Nemhauser and Trotter's local optimization theorem
- The NP-Completeness of Some Edge-Partition Problems
- Parameterized and Exact Computation
- Edge-packing in planar graphs
- Chain packing in graphs
- Towards optimal kernel for edge-disjoint triangle packing
Cited In (6)
This page was built for publication: Edge-disjoint packing of stars and cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2629232)
