Set-based unified approach for summarization of a multi-attributed graph
Rich availability of real world knowledge in a graph based on attributes of each vertex and
its interactions, is a valuable source of information. However, it is hard to derive this useful …
its interactions, is a valuable source of information. However, it is hard to derive this useful …
EM-FGS: Graph sparsification via faster semi-metric edges pruning
Graph sparsification is a useful approach for mining, analyzing, and visualizing large
graphs. It simplifies the structure of a graph by pruning some of the edges while preserving …
graphs. It simplifies the structure of a graph by pruning some of the edges while preserving …
SP2 spanner construction for shortest path computation on streaming graph
Computing shortest paths in graphs is one of the most fundamental and well-studied
problem. It has a range of applications such as robot navigation, optimal pipelining of VLSI …
problem. It has a range of applications such as robot navigation, optimal pipelining of VLSI …
Accelerating community-search problem through faster graph dedensification
Community-search is the problem of finding a densely connected subgraph from a large
graph, for given set of query nodes. It is useful, for example, when some high profiled …
graph, for given set of query nodes. It is useful, for example, when some high profiled …
Traversal optimizations and analysis for large graph clustering
Graph is an extremely versatile data structure in terms of its expressiveness and flexibility to
model a range of real life phenomenon, such as social, biological, sensor, and computer …
model a range of real life phenomenon, such as social, biological, sensor, and computer …
Protocol for dynamic self-adaptive coupling in component-based distributed systems
P Dini, C Dini, M Popescu… - … International Workshop on …, 2004 - ieeexplore.ieee.org
Coupling has been originally defined as the measure of the strength of association
established by a connection from one module to another. Most of the existing techniques …
established by a connection from one module to another. Most of the existing techniques …
A Self-Organizing Map-Based Spectral Clustering on Shortest Path of a Graph
This paper proposes a new data clustering method for non-categorical, large datasets from a
graph clustering point of view. The proposed method applies the Self Organizing Map (SOM) …
graph clustering point of view. The proposed method applies the Self Organizing Map (SOM) …