The Complexity of Perfect Packings in Dense Graphs

DOI10.1007/978-3-319-55911-7_21zbMath1485.68185MaRDI QIDQ2988829

Jie Han

Publication date: 19 May 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-55911-7_21

zbMATH Keywords

computational complexity; absorbing method; perfect packing

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)