Algorithmic trade-offs for girth approximation in undirected graphs

From MaRDI portal
Publication:6575136














This page was built for publication: Algorithmic trade-offs for girth approximation in undirected graphs

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