Parameterized clique on inhomogeneous random graphs
From MaRDI portal
Publication:2341758
DOI10.1016/j.dam.2014.10.018zbMath1311.05130OpenAlexW2062628689MaRDI QIDQ2341758
Anton Krohmer, Tobias Friedrich
Publication date: 28 April 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.10.018
Random graphs (graph-theoretic aspects) (05C80) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (4)
Finding Induced Subgraphs in Scale-Free Inhomogeneous Random Graphs ⋮ On the kernel size of clique cover reductions for random intersection graphs ⋮ Cliques in rank-1 random graphs: the role of inhomogeneity ⋮ Detecting a planted community in an inhomogeneous random graph
Uses Software
Cites Work
- Unnamed Item
- Number of cliques in random scale-free network ensembles
- Connected components in random graphs with given expected degree sequences
- On the average-case complexity of parameterized clique
- A Random Graph Model for Power Law Graphs
- Random Graphs and Complex Networks
- Efficient Generation of Networks with Given Expected Degrees
- Large Cliques in a Power-Law Random Graph
- Emergence of Scaling in Random Networks
- A random graph model for massive graphs
- Power-Law Distributions in Empirical Data
- Average Case Complete Problems
- The Structure and Function of Complex Networks
- A Brief History of Generative Models for Power Law and Lognormal Distributions
- Parameterized Clique on Scale-Free Networks
- Reducibility among Combinatorial Problems
- On a conditionally Poissonian graph process
- Concentration of Measure for the Analysis of Randomized Algorithms
This page was built for publication: Parameterized clique on inhomogeneous random graphs