No label defined (Q5090451)

From MaRDI portal

Revision as of 16:36, 29 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article; zbMATH DE number 7559114

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 7559114

Statements

scholarly article

0 references

Tobias Friedrich

0 references

publication date

18 July 2022

0 references

zbMATH Keywords

graph theory

0 references

graph algorithms

0 references

network science

0 references

hyperbolic geometry

0 references

MaRDI profile type

MaRDI publication profile

0 references

Tree decompositions and social graphs

0 references

A random graph model for massive graphs

0 references

A Random Graph Model for Power Law Graphs

0 references

Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover

0 references

Hyperbolic graph generator

0 references

Fast probabilistic algorithms for Hamiltonian circuits and matchings

0 references

Emergence of Scaling in Random Networks

0 references

Hyperbolic Random Graphs: Separators and Treewidth

0 references

Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane

0 references

0 references

Hyperbolic Embeddings for Near-Optimal Greedy Routing

0 references

Towards a Systematic Evaluation of Generative Network Models

0 references

Cliques in hyperbolic random graphs

0 references

On the largest component of a hyperbolic model of complex networks

0 references

The probability of connectivity in a hyperbolic model of complex networks

0 references

Average-Case Complexity

0 references

The diameter of a scale-free random graph

0 references

0 references

Sampling Geometric Inhomogeneous Random Graphs in Linear Time

0 references

Geometric inhomogeneous random graphs

0 references

Clustering and the Hyperbolic Geometry of Complex Networks

0 references

Obtaining Optimal<i>k</i>-Cardinality Trees Fast

0 references

Connected components in random graphs with given expected degree sequences

0 references

The average distances in random graphs with given expected degrees

0 references

Power-Law Distributions in Empirical Data

0 references

Exact Combinatorial Branch-and-Bound for Graph Bisection

0 references

0 references

On the average-case complexity of parameterized clique

0 references

On the Diameter of Hyperbolic Random Graphs

0 references

On the Diameter of Hyperbolic Random Graphs

0 references

Treewidth of Erdős-Rényi random graphs, random intersection graphs, and scale-free random graphs

0 references

Random Plane Networks

0 references

Random Hyperbolic Graphs: Degree Sequence and Clustering

0 references

Random Graphs and Complex Networks

0 references

0 references

0 references

A Bound for the Diameter of Random Hyperbolic Graphs

0 references

Average Case Complete Problems

0 references

A Brief History of Generative Models for Power Law and Lognormal Distributions

0 references

On a conditionally Poissonian graph process

0 references

Random Geometric Graphs

0 references

Generating Practical Random Hyperbolic Graphs in Near-Linear Time and with Sub-Linear Memory

0 references

Metric Embedding, Hyperbolic Space, and Social Networks

0 references

Generating Random Hyperbolic Graphs in Subquadratic Time

0 references

Collective dynamics of ‘small-world’ networks

0 references

Identifiers

10.4230/LIPIcs.STACS.2019.5

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5090451

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5090451&oldid=36831003"