First-Order Model-Checking in Random Graphs and Complex Networks
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 7650219
- Parameterized model checking of weighted networks
- Model checking lower bounds for simple graphs
- Model checking lower bounds for simple graphs
- First-order model checking on generalisations of pushdown graphs.
- scientific article; zbMATH DE number 7445170
- Graph-theoretic analysis of complex stochastic networks
- Model checking and boolean graphs
- scientific article; zbMATH DE number 1959499
- scientific article; zbMATH DE number 777287
Cites work
- scientific article; zbMATH DE number 1688350 (Why is no real title available?)
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 5081744 (Why is no real title available?)
- scientific article; zbMATH DE number 5776838 (Why is no real title available?)
- scientific article; zbMATH DE number 3819693 (Why is no real title available?)
- scientific article; zbMATH DE number 969067 (Why is no real title available?)
- scientific article; zbMATH DE number 7650219 (Why is no real title available?)
- (Meta) kernelization
- A critical point for random graphs with a given degree sequence
- A survey of statistical network models
- Algorithmic Meta-theorems
- Algorithmic uses of the Feferman-Vaught theorem
- Average Case Complete Problems
- Bidimensionality and kernels
- Clustering and the hyperbolic geometry of complex networks
- Collective dynamics of `small-world' networks
- Complex graphs and networks
- Computational Complexity
- Connected components in random graphs with given expected degree sequences
- Deciding first-order properties of locally tree-decomposable structures
- Diameter, connectivity, and phase transition of the uniform random intersection graph
- Diameters in preferential attachment models
- Emergence of Scaling in Random Networks
- Fixed-parameter tractability, definability, and model-checking
- Grad and classes with bounded expansion. I: Decompositions
- Graph clustering
- Graph minors. XVI: Excluding a non-planar graph
- Hyperbolic random graphs: separators and treewidth
- Hyperbolicity, degeneracy, and expansion of random intersection graphs
- Linear time solvable optimization problems on graphs of bounded clique-width
- Logic, graphs, and algorithms
- Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size
- Motif Counting in Preferential Attachment Graphs
- On Random Intersection Graphs: The Subgraph Problem
- Parameterized algorithms
- Power-law distributions in empirical data
- Probabilities on finite models
- Query evaluation via tree-decompositions
- Random graphs.
- Structural sparsity of complex networks: bounded expansion in random models and real-world graphs
- Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs
- The Size of the Giant Component of a Random Graph with a Given Degree Sequence
- The average distances in random graphs with given expected degrees
- The complexity of first-order and monadic second-order logic revisited
- The degree sequence of a scale-free random graph process
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The polynomial-time hierarchy
- The small-world phenomenon: an algorithmic perspective
- Treewidth of Erdős-Rényi random graphs, random intersection graphs, and scale-free random graphs
Cited in
(2)
This page was built for publication: First-Order Model-Checking in Random Graphs and Complex Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874510)
