Edge open packing: complexity, algorithmic aspects, and bounds

MaRDI QIDQ6524245arXivFDO

Authors Boštjan Brešar, B. Samadi

Published in arXiv

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

This page was built for publication: Edge open packing: complexity, algorithmic aspects, and bounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6524245)