Sciweavers

678 search results - page 14 / 136
» Structural Properties of Sparse Graphs
Sort
View
SDM
2007
SIAM
143views Data Mining» more  SDM 2007»
13 years 11 months ago
Less is More: Compact Matrix Decomposition for Large Sparse Graphs
Given a large sparse graph, how can we find patterns and anomalies? Several important applications can be modeled as large sparse graphs, e.g., network traffic monitoring, resea...
Jimeng Sun, Yinglian Xie, Hui Zhang, Christos Falo...
ORL
2008
101views more  ORL 2008»
13 years 10 months ago
Gear composition and the stable set polytope
We present a new graph composition that produces a graph G from a given graph H and a fixed graph B called gear and we study its polyhedral properties. This composition yields cou...
Anna Galluccio, Claudio Gentile, Paolo Ventura
LATA
2010
Springer
14 years 7 months ago
Untestable Properties Expressible with Four First-Order Quantifiers
Abstract. In property testing, the goal is to distinguish between structures that have some desired property and those that are far from having the property, after examining only a...
Charles Jordan and Thomas Zeugmann
PAKDD
2010
ACM
175views Data Mining» more  PAKDD 2010»
14 years 2 months ago
EigenSpokes: Surprising Patterns and Scalable Community Chipping in Large Graphs
Abstract. We report a surprising, persistent pattern in large sparse social graphs, which we term EigenSpokes. We focus on large Mobile Call graphs, spanning about 186K nodes and m...
B. Aditya Prakash, Ashwin Sridharan, Mukund Seshad...
APPROX
2004
Springer
179views Algorithms» more  APPROX 2004»
14 years 3 months ago
Maximum Weight Independent Sets and Matchings in Sparse Random Graphs. Exact Results Using the Local Weak Convergence Method
ABSTRACT: Let G(n, c/n) and Gr(n) be an n-node sparse random graph and a sparse random rregular graph, respectively, and let I(n, r) and I(n, c) be the sizes of the largest indepen...
David Gamarnik, Tomasz Nowicki, Grzegorz Swirszcz