Results 1  10
of
84,941
Distributed Maximal Clique Computation
"... Abstract—Maximal cliques are important substructures in graph analysis. Many algorithms for computing maximal cliques have been proposed in the literature; however, most of them are sequential algorithms that cannot scale due to the high complexity of the problem, while existing parallel algorithms ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
for computing maximal cliques are mostly immature and especially suffer from skewed workload. In this paper, we first propose a distributed algorithm built on a sharenothing architecture for computing the set of maximal cliques. We effectively address the problem of skewed workload distribution due to high
Distributed Discovery of Large NearCliques
"... Given an undirected graph and 0 ≤ ɛ ≤ 1, a set of nodes is called an ɛnear clique if all but an ɛ fraction of the pairs of nodes in the set have a link between them. In this paper we present a fast synchronous network algorithm that uses small messages and finds a nearclique. Specifically, we pr ..."
Abstract
 Add to MetaCart
Given an undirected graph and 0 ≤ ɛ ≤ 1, a set of nodes is called an ɛnear clique if all but an ɛ fraction of the pairs of nodes in the set have a link between them. In this paper we present a fast synchronous network algorithm that uses small messages and finds a nearclique. Specifically, we
Distributed Maximal Clique Computation and Management
"... Abstract—Maximal cliques are elementary substructures in a graph and instrumental in graph analysis such as the structural analysis of many complex networks, graph clustering and community detection, network hierarchy detection, emerging pattern mining, vertex importance measures, etc. However, the ..."
Abstract
 Add to MetaCart
, there is barely any efficient method for querying or updating the set of maximal cliques. In this paper, we first propose a distributed algorithm built on a sharenothing architecture for computing the set of maximal cliques. We effectively address the problem of skewed workload distribution due to high
Clique percolation
, 2008
"... Derényi, Palla and Vicsek introduced the following dependent percolation model, in the context of finding communities in networks. Starting with a random graph G generated by some rule, form an auxiliary graph G ′ whose vertices are the kcliques of G, in which two vertices are joined if the corresp ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Derényi, Palla and Vicsek introduced the following dependent percolation model, in the context of finding communities in networks. Starting with a random graph G generated by some rule, form an auxiliary graph G ′ whose vertices are the kcliques of G, in which two vertices are joined
Brief announcement: A hierarchy of congested clique models, from broadcast to unicast
 Proc 2015 ACM Symp Principles Distributed Computing
, 2015
"... etienne.fr The CONGEST model is a synchronous, messagepassing model of distributed computation in which each node can send (possibly different) messages ofO(logn) bits along each of its incident communication links in each round, where n is the number of computing nodes in the system. In the parti ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
etienne.fr The CONGEST model is a synchronous, messagepassing model of distributed computation in which each node can send (possibly different) messages ofO(logn) bits along each of its incident communication links in each round, where n is the number of computing nodes in the system. In the par
Graph domination, coloring and cliques in telecommunications
 Handbook of Optimization in Telecommunications, pages 865–890. Spinger Science + Business
, 2006
"... This paper aims to provide a detailed survey of existing graph models and algorithms for important problems that arise in different areas of wireless telecommunication. In particular, applications of graph optimization problems such as minimum dominating set, minimum vertex coloring and maximum cliq ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
clique in multihop wireless networks are discussed. Different forms of graph domination have been used extensively to model clustering in wireless ad hoc networks. Graph coloring problems and their variants have been used to model channel assignment and scheduling type problems in wireless networks
A GraphTheoretic Definition of a Sociometric Clique
 Journal of Mathematical Sociology
, 1973
"... The intent of this paper is to provide a definition of a sociometric clique in the language of graph theory. This problem is viewed from two perspectives: maintaining fidelity to the intuitive notion of a clique; and providing adequate computational mechanics for large bodies of data. Luce's (1 ..."
Abstract

Cited by 66 (0 self)
 Add to MetaCart
The intent of this paper is to provide a definition of a sociometric clique in the language of graph theory. This problem is viewed from two perspectives: maintaining fidelity to the intuitive notion of a clique; and providing adequate computational mechanics for large bodies of data. Luce
Finding Maximum Cliques with Distributed Ants
 GECCO 2004, Lecture Notes in Computer Science
"... Abstract. In this paper we describe an ant system algorithm (ASMC) for the problem of finding the maximum clique in a given graph. In the algorithm each ant has only local knowledge of the graph. Working together the ants induce a candidate set of vertices from which a clique can be constructed. The ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract. In this paper we describe an ant system algorithm (ASMC) for the problem of finding the maximum clique in a given graph. In the algorithm each ant has only local knowledge of the graph. Working together the ants induce a candidate set of vertices from which a clique can be constructed
Optimal Deterministic Routing and Sorting on the Congested Clique
"... Consider a clique of n nodes, where in each synchronous round each pair of nodes can exchange O(log n) bits. We provide deterministic constanttime solutions for two problems in this model. The first is a routing problem where each node is source and destination of n messages of size O(log n). The s ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
Consider a clique of n nodes, where in each synchronous round each pair of nodes can exchange O(log n) bits. We provide deterministic constanttime solutions for two problems in this model. The first is a routing problem where each node is source and destination of n messages of size O(log n
Results 1  10
of
84,941