Sciweavers

336 search results - page 47 / 68
» Harmonic evolutions on graphs
Sort
View
VLDB
2005
ACM
177views Database» more  VLDB 2005»
15 years 7 months ago
Discovering Large Dense Subgraphs in Massive Graphs
We present a new algorithm for finding large, dense subgraphs in massive graphs. Our algorithm is based on a recursive application of fingerprinting via shingles, and is extreme...
David Gibson, Ravi Kumar, Andrew Tomkins
COMSWARE
2008
IEEE
15 years 3 months ago
Extracting dense communities from telecom call graphs
Social networks refer to structures made of nodes that represent people or other entities embedded in a social context, and whose edges represent interaction between entities. Typi...
Vinayaka Pandit, Natwar Modani, Sougata Mukherjea,...
WEA
2005
Springer
176views Algorithms» more  WEA 2005»
15 years 7 months ago
High-Performance Algorithm Engineering for Large-Scale Graph Problems and Computational Biology
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...
David A. Bader
CORR
2007
Springer
110views Education» more  CORR 2007»
15 years 1 months ago
Graph Annotations in Modeling Complex Network Topologies
abstract such additional information as network annotations. We introduce a network topology modeling framework that treats annotations as an extended correlation profile of a net...
Xenofontas A. Dimitropoulos, Dmitri V. Krioukov, A...
TAOSD
2010
15 years 9 days ago
A Graph-Based Aspect Interference Detection Approach for UML-Based Aspect-Oriented Models
Abstract. Aspect Oriented Modeling (AOM) techniques facilitate separate modeling of concerns and allow for a more flexible composition of these than traditional modeling technique...
Selim Ciraci, Wilke Havinga, Mehmet Aksit, Christo...