Results 41 to 50 of about 47,591 (350)
Linear Clique-Width for Hereditary Classes of Cographs [PDF]
, 2016 The class of cographs is known to have unbounded linear clique-width. We prove that a hereditary class of cographs has bounded linear clique-width if and only if it does not contain all quasi-threshold graphs or their complements. The proof borrows ideas
Vincent Vatter +5 more
core +1 more source
IEEE/ACM Transactions on Networking, 2019 This paper proposes and investigates a framework for clique gossip protocols. As complete subnetworks, the existence of cliques is ubiquitous in various social, computer, and engineering networks. By clique gossiping, nodes interact with each other along a sequence of cliques.
Yang Liu 0125 +3 more
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
From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2017 We consider questions that arise from the intersection between theareas of approximation algorithms, subexponential-time algorithms, and fixed-parameter tractable algorithms.
Parinya Chalermsook +6 more
semanticscholar +1 more source
Independent sets of maximum weight in apple-free graphs [PDF]
, 2010 We present the first polynomial-time algorithm to solve the maximum weight independent set problem for apple-free graphs, which is a common generalization of several important classes where the problem can be solved efficiently, such as claw-free graphs,
Lozin, Vadim V. +2 more
core +1 more source
Reconfiguration of Cliques in a Graph [PDF]
Discrete Applied Mathematics, 2015 We study reconfiguration problems for cliques in a graph, which determine whether there exists a sequence of cliques that transforms a given clique into another one in a step-by-step fashion. As one step of a transformation, we consider three different types of rules, which are defined and studied in reconfiguration problems for independent sets.
Takehiro Ito +2 more
openaire +3 more sources
Exploring Small-World Network with an Elite-Clique: Bringing Embeddedness Theory into the Dynamic Evolution of a Venture Capital Network [PDF]
Soc. Networks, 2018 This paper uses a network dynamics model to explain the formation of a small-world network with an elite-clique. This network is a small-world network with an elite-clique at its center in which elites are also the centers of many small groups.
Weiwei Gu, Jar-der Luo, Jifan Liu
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
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