26 citations · 34 across the 15 of their papers we have counts for
5 papers · 1 filter
Maximal Cliques in Scale-Free Random Graphs
Thomas Bläsius, Maximillian Katzmann, Clara Stegehuis
We investigate the number of maximal cliques, i.e., cliques that are not contained in any larger clique, in three network models: Erdős-Rényi random graphs, inhomogeneous random gr…
On the Giant Component of Geometric Inhomogeneous Random Graphs
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann +2
In this paper we study the threshold model of \emph{geometric inhomogeneous random graphs} (GIRGs); a generative random graph model that is closely related to \emph{hyperbolic rand…
Partitioning the Bags of a Tree Decomposition Into Cliques
Thomas Bläsius, Maximilian Katzmann, Marcus Wilhelm
We consider a variant of treewidth that we call clique-partitioned treewidth in which each bag is partitioned into cliques. This is motivated by the recent development of FPT-algor…
Real-World Networks are Low-Dimensional: Theoretical and Practical Assessment
Tobias Friedrich, Andreas Göbel, Maximilian Katzmann +1
Detecting the dimensionality of graphs is a central topic in machine learning. While the problem has been tackled empirically as well as theoretically, existing methods have severa…
Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs
Tobias Friedrich, Andreas Göbel, Maximilian Katzmann +1
A recent trend in the context of graph theory is to bring theoretical analyses closer to empirical observations, by focusing the studies on random graph models that are used to rep…