Results 31 to 40 of about 135,666 (285)
Broadcast Congested Clique [PDF]
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019 We develop techniques to prove lower bounds for the BCAST(log n) Broadcast Congested Clique model (a distributed message passing model where in each round, each processor can broadcast an O(log n)-sized message to all other processors). Our techniques are built to prove bounds for natural input distributions.
Chen, Lijie, Grossman, Ofer
openaire +2 more sources
Maxclique and Unit Disk Characterizations of Strongly Chordal Graphs
Discussiones Mathematicae Graph Theory, 2014 Maxcliques (maximal complete subgraphs) and unit disks (closed neighborhoods of vertices) sometime play almost interchangeable roles in graph theory. For instance, interchanging them makes two existing characterizations of chordal graphs into two new ...
Caria Pablo De, McKee Terry A.
doaj +1 more source
Clique densification in networks
Physical Review E, 2023 14 pages, 11 figures.
Haochen Pi +3 more
openaire +3 more sources
On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs [PDF]
Discrete Applied Mathematics, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alcón, Liliana Graciela +3 more
openaire +2 more sources
A Note on the Signed Clique Domination Numbers of Graphs
Journal of Mathematics, 2022 Let G=V,E be a graph. A function f:E⟶−1,+1 is said to be a signed clique dominating function (SCDF) of G if ∑e∈EKfe≥1 holds for every nontrivial clique K in G. The signed clique domination number of G is defined as γscl′G=min∑e∈EGfe|fis an SCDF ofG.
Baogen Xu, Ting Lan, Mengmeng Zheng
doaj +1 more source
An Algebraic Approach to Clustering and Classification with Support Vector Machines
Mathematics, 2022 In this note, we propose a novel classification approach by introducing a new clustering method, which is used as an intermediate step to discover the structure of a data set.
Güvenç Arslan +2 more
doaj +1 more source
On a class of polynomials associated with the Cliques in a graph and its applications
International Journal of Mathematics and Mathematical Sciences, 1989 The clique polynomial of a graph is defined. An explicit formula is then derived for the clique polynomial of the complete graph. A fundamental theorem and a reduction process is then given for clique polynomials.
E. J. Farrell
doaj +1 more source
Hard optimization problems have soft edges
Scientific Reports, 2023 Finding a Maximum Clique is a classic property test from graph theory; find any one of the largest complete subgraphs in an Erdös-Rényi G(N, p) random graph. We use Maximum Clique to explore the structure of the problem as a function of N, the graph size,
Raffaele Marino, Scott Kirkpatrick
doaj +1 more source
Between Treewidth and Clique-width [PDF]
, 2014 Many hard graph problems can be solved efficiently when restricted to graphs of bounded treewidth, and more generally to graphs of bounded clique-width.
B Courcelle +12 more
core +1 more source
SIAM Journal on Discrete MathematicsWe study how many copies of a graph $F$ that another graph $G$ with a given number of cliques is guaranteed to have. For example, one of our main results states that for all $t\ge 2$, if $G$ is an $n$ vertex graph with $kn^{3/2}$ triangles and $k$ is sufficiently large in terms of $t$, then $G$ contains at least \[\Omega(\min\{k^t n^{3/2},k^{\frac{2t^2}
Quentin Dubroff +3 more
openaire +2 more sources