Finding Induced Subgraphs in Scale-Free Inhomogeneous Random Graphs
From MaRDI portal
Recommendations
Cites work
- Algorithmic complexity of power law networks
- Finding four-node subgraphs in triangle time
- Generating simple random graphs with prescribed degree distribution
- Large cliques in a power-law random graph
- On a conditionally Poissonian graph process
- On the average-case complexity of parameterized clique
- Parameterized clique on inhomogeneous random graphs
- Power-law distributions in empirical data
- Random graphs and complex networks. Volume 1
- Reducibility among combinatorial problems
- The average distances in random graphs with given expected degrees
- The phase transition in inhomogeneous random graphs
Cited in
(5)- Distinguishing power-law uniform random graphs from inhomogeneous random graphs through small subgraphs
- Optimal subgraph structures in scale-free configuration models
- Parameterized clique on inhomogeneous random graphs
- Subgraph detection
- Finding induced subgraphs in scale-free inhomogeneous random graphs
This page was built for publication: Finding Induced Subgraphs in Scale-Free Inhomogeneous Random Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5881224)