The parallel complexity of approximating the High Degree Subgraph problem

From MaRDI portal

Revision as of 14:29, 28 November 2024 by Import241128011130 (talk | contribs) (Created automatically from import241128011130)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:6487954

Jump to:navigation, search

DOI10.1007/bfb0015416zbMath1512.68187MaRDI QIDQ6487954

José D. P. Rolim, Alexander E. Andreev, Elias Dahlhaus, Andrea E. F. Clementi, Sergio De Agostino, Pierluigi Crescenzi

Publication date: 21 March 2023

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

This page was built for publication: The parallel complexity of approximating the High Degree Subgraph problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6487954&oldid=37938594"