Results 41 to 50 of about 34,680 (295)
Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs [PDF]
ACM-SIAM Symposium on Discrete Algorithms, 2017 Recently, hardness results for problems in P were achieved using reasonable complexity-theoretic assumptions such as the Strong Exponential Time Hypothesis.
D. Coudert, G. Ducoffe, Alexandru Popa
semanticscholar +1 more source
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
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
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
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
A Maximal Clique Based Multiobjective Evolutionary Algorithm for Overlapping Community Detection
IEEE Transactions on Evolutionary Computation, 2017 Detecting community structure has become one important technique for studying complex networks. Although many community detection algorithms have been proposed, most of them focus on separated communities, where each node can belong to only one community.
Xuyun Wen +7 more
semanticscholar +1 more source