On the complexity of digraph packings

DOI10.1016/S0020-0190(02)00478-7zbMath1173.68528OpenAlexW2067491157MaRDI QIDQ1007581

Romeo Rizzi, Richard C. Brewster

Publication date: 23 March 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(02)00478-7

zbMATH Keywords

computational complexitygraph packingsgraph algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Oriented star packings

Cites Work

• Unnamed Item
• Unnamed Item
• An extension of matching theory
• Packings by cliques and by finite families of graphs
• On generalized matching problems
• Packing subgraphs in a graph
• Efficient subgraphs packing
• On the Complexity of General Graph Factor Problems

This page was built for publication: On the complexity of digraph packings