Parameterized Clique on Scale-Free Networks
From MaRDI portal
Publication:4909582
DOI10.1007/978-3-642-35261-4_68zbMath1260.68455OpenAlexW135582044MaRDI QIDQ4909582
Anton Krohmer, Tobias Friedrich
Publication date: 21 March 2013
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-35261-4_68
Analysis of algorithms and problem complexity (68Q25) Random graphs (graph-theoretic aspects) (05C80) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Randomized algorithms (68W20)
Related Items (6)
On the kernel size of clique cover reductions for random intersection graphs ⋮ De-anonymization of heterogeneous random graphs in quasilinear time ⋮ Cliques in hyperbolic random graphs ⋮ Superlogarithmic Cliques in Dense Inhomogeneous Random Graphs ⋮ Parameterized clique on inhomogeneous random graphs ⋮ On the average-case complexity of parameterized clique
This page was built for publication: Parameterized Clique on Scale-Free Networks
