Pages that link to "Item:Q2316938"
From MaRDI portal
The following pages link to Structural sparsity of complex networks: bounded expansion in random models and real-world graphs (Q2316938):
Displayed 11 items.
- Minimum vertex cover in generalized random graphs with power law degree distribution (Q306728) (← links)
- Eccentricity queries and beyond using hub labels (Q2166770) (← links)
- Width, depth, and space: tradeoffs between branching and dynamic programming (Q2287480) (← links)
- A general purpose algorithm for counting simple cycles and simple paths of any length (Q2415361) (← links)
- Parameterized complexity of envy-free resource allocation in social networks (Q2680801) (← links)
- Configuring Random Graph Models with Fixed Degree Sequences (Q4641712) (← links)
- Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness (Q4984870) (← links)
- First-Order Model-Checking in Random Graphs and Complex Networks (Q5874510) (← links)
- Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size (Q6084357) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- A color-avoiding approach to subgraph counting in bounded expansion classes (Q6174815) (← links)