Results 41 to 50 of about 135,666 (285)
Clique coverings of graphs V: maximal-clique partitions [PDF]
Bulletin of the Australian Mathematical Society, 1982 A maximal-clique partition of a graph G is a way of covering G with maximal complete subgraphs, such that every edge belongs to exactly one of the subgraphs. If G has a maximal-clique partition, the maximal-clique partition number of G is the smallest cardinality of such partitions. In this paper the existence of maximal-clique partitions is discussed –
Pullman, N. J., Shank, H., Wallis, W. D.
openaire +2 more sources
High Density Subspace Clustering Algorithm for High Dimensional Data
Journal of Harbin University of Science and Technology, 2020 Highdimensional data have the characteristics of sparsity and vulnerability to dimension disaster, which makes it is difficult to ensure the precision and efficiency of high dimensional data clustering Therefore the method of subspace clustering is ...
WAN Jing +3 more
doaj +1 more source
Fixation probability on clique-based graphs
, 2017 The fixation probability of a mutant in the evolutionary dynamics of Moran process is calculated by the Monte-Carlo method on a few families of clique-based graphs.
Choi, Jeong-Ok, Yu, Unjong
core +1 more source
Clique-Stable Set separation in perfect graphs with no balanced skew-partitions [PDF]
, 2016 Inspired by a question of Yannakakis on the Vertex Packing polytope of perfect graphs, we study the Clique-Stable Set Separation in a non-hereditary subclass of perfect graphs.
Lagoutte, Aurélie, Trunck, Théophile
core +5 more sources
On clique graphs and clique regular graphs
Discrete MathematicsIf $Γ$ is a graph for which every edge is in exactly one clique of order $ω$, then one can form a new graph with vertex set equal to these cliques. This is a generalization of the line graph of $Γ$. We discover many general results and classifications related to these clique graph that will be useful to researchers studying these objects. In particular,
Robert R. Petro, Connor M. Phillips
openaire +2 more sources
IEEE AccessMajor depressive disorder (MDD) is associated with complex disruptions in brain function, yet the underlying neural mechanisms remain incompletely understood. Traditional approaches to studying functional brain networks have primarily focused on pairwise
Semen A. Kurkin +6 more
doaj +1 more source
Clique trees of infinite locally finite chordal graphs [PDF]
, 2018 We investigate clique trees of infinite locally finite chordal graphs. Our main contribution is a bijection between the set of clique trees and the product of local finite families of finite trees.
Hofer-Temmel, Christoph, Lehner, Florian
core +1 more source
MusicSwarm: Biologically Inspired Intelligence for Music Composition
Advanced Intelligent Systems, EarlyView.Biologically inspired swarms of frozen foundation models self‐organize to compose complex music without fine‐tuning. By coordinating through stigmergic signals, decentralized agents dynamically evolve specialized roles and adapt to solve complex tasks.
Markus J. Buehler
wiley +1 more source
An Efficient Influence Maximization Algorithm Based on Clique in Social Networks
IEEE Access, 2019 Influence Maximization is to find a subset of influential nodes so that they can spread influence to the largest range in a network. The study on influence maximization is of great importance, and many solutions have been developed, including greedy ...
Huan Li +3 more
doaj +1 more source
Split Clique Graph Complexity [PDF]
Theoretical Computer Science, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alcón, Liliana Graciela +3 more
openaire +3 more sources