Speeding up networks mining via neighborhood diversity
From MaRDI portal
Publication:6487594
DOI10.4230/LIPICS.FUN.2021.21zbMATH Open1515.68234MaRDI QIDQ6487594
Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno
Publication date: 7 February 2023
girthmaximum matchingparameterized complexityneighborhood diversitytriangle countingglobal minimum vertex cut
Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (2)
Parameterized complexity for iterated type partitions and modular-width ⋮ Getting linear time in graphs of bounded neighborhood diversity
This page was built for publication: Speeding up networks mining via neighborhood diversity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487594)
