Results 131 to 140 of about 47,591 (350)
GraphZIP: a clique-based sparse graph compression method
Journal of Big Data, 2018 Massive graphs are ubiquitous and at the heart of many real-world problems and applications ranging from the World Wide Web to social networks. As a result, techniques for compressing graphs have become increasingly important and remains a challenging ...
Ryan A. Rossi, R. Zhou
semanticscholar +1 more source
Density Conditions for k $k$ Vertex‐Disjoint Triangles in Tripartite Graphs
Journal of Graph Theory, EarlyView.ABSTRACT Let n , k $n,k$ be positive integers such that n ≥ k $n\ge k$ and G $G$ be a tripartite graph with parts A , B , C $A,B,C$ such that ∣ A ∣ = ∣ B ∣ = ∣ C ∣ = n $| A| =| B| =| C| =n$. Denote the edge densities of G [ A , B ] , G [ A , C ] $G[A,B],G[A,C]$ and G [ B , C ] $G[B,C]$ by α , β $\alpha ,\beta $ and γ $\gamma $, respectively.
Mingyang Guo, Klas Markström
wiley +1 more source
Discrete Mathematics, 1990 A subset D of the vertex set V(G) of a graph G is called dominating, if for each vertex \(x\in V(G)-D\) there exists a vertex \(y\in D\) adjacent to x. If a dominating set induces a complete subgraph of G, it is called a dominating clique. Some existence theorems for dominating clique sets of small cardinalities are proved. The clique domination number
Margaret B. Cozzens, Laura L. Kelleher
openaire +3 more sources
Journal of Graph Theory, EarlyView.ABSTRACT In an effort to understand the complexity of the maximum independent set problem, Chvátal introduced t‐perfect graphs. While a full characterization of this class remains open, important progress has been made for claw‐free graphs [Bruhn and Stein, Math. Program. 2012] and P 5 ${P}_{5}$‐free graphs [Bruhn and Fuchs, SIAM J. Discrete Math. 2017]
Yixin Cao, Shenghua Wang
wiley +1 more source
On clique convergence of graphs
AKCE International Journal of Graphs and Combinatorics, 2016 Let G be a graph and KG be the set of all cliques of G, then the clique graph of G denoted by K(G) is the graph with vertex set KG and two elements Qi,Qj∈KG form an edge if and only if Qi∩Qj≠0̸.
S.M. Hegde, Suresh Dara
doaj +1 more source
Partitioning a permutation graph: algorithms and an application. [PDF]
In this paper we discuss the problem of partitioning a permutation graph into cliques of bounded size, and describe a real-life application of this problem encountered at a manufacturing company.
Moonen, Linda, Spieksma, Frederik
core
Well-Quasi-Order for Permutation Graphs Omitting a Path and a Clique [PDF]
, 2015 We consider well-quasi-order for classes of permutation graphs which omit both a path and a clique. Our principle result is that the class of permutation graphs omitting $P_5$ and a clique of any size is well-quasi-ordered.
Vatter, Vincent +4 more
core
Chromatic Ramsey Numbers and Two‐Color Turán Densities
Journal of Graph Theory, EarlyView.ABSTRACT Given a graph G, its 2‐color Turán number ex ( 2 ) ( n , G ) is the maximum number of edges in an n‐vertex graph, such that the edges can be colored with two colors avoiding a monochromatic copy of G. Let π ( 2 ) ( G ) = lim n → ∞ ex ( 2 ) ( n , G ) / n 2 be the 2‐color Turán density of G.
Maria Axenovich, Simon Gaa, Dingyuan Liu
wiley +1 more source
Network‐assisted protein identification and data interpretation in shotgun proteomics
Molecular Systems Biology, 2009 Protein assembly and biological interpretation of the assembled protein lists are critical steps in shotgun proteomics data analysis. Although most biological functions arise from interactions among proteins, current protein assembly pipelines treat ...
Jing Li +5 more
doaj +1 more source
Two Efficient Local Search Algorithms for Maximum Weight Clique Problem
AAAI Conference on Artificial Intelligence, 2016 The Maximum Weight Clique problem (MWCP) is an important generalization of the Maximum Clique problem with wide applications. This paper introduces two heuristics and develops two local search algorithms for MWCP.
Yiyuan Wang, Shaowei Cai, Minghao Yin
semanticscholar +1 more source