Graph Burning: Bounds and Hardness

MaRDI QIDQ6523956arXivFDO

Authors Dhanyamol Antony, Anita Das, Shirish Gosavi, Dalu Jacob, Shashanka Kulamarva

Published in arXiv

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: Graph Burning: Bounds and Hardness

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