Sciweavers

3534 search results - page 702 / 707
» On Structural Analysis of Large Networks
Sort
View
KDD
2009
ACM
203views Data Mining» more  KDD 2009»
14 years 8 months ago
Characterizing individual communication patterns
The increasing availability of electronic communication data, such as that arising from e-mail exchange, presents social and information scientists with new possibilities for char...
R. Dean Malmgren, Jake M. Hofman, Luis A. N. Amara...
STOC
2007
ACM
239views Algorithms» more  STOC 2007»
14 years 7 months ago
Approximating minimum bounded degree spanning trees to within one of optimal
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
Mohit Singh, Lap Chi Lau
SPAA
2009
ACM
14 years 2 months ago
Weak graph colorings: distributed algorithms and applications
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
Fabian Kuhn
COCOON
2007
Springer
14 years 1 months ago
Connected Coloring Completion for General Graphs: Algorithms and Complexity
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
Benny Chor, Michael R. Fellows, Mark A. Ragan, Igo...
NN
2007
Springer
14 years 1 months ago
Impact of Higher-Order Correlations on Coincidence Distributions of Massively Parallel Data
The signature of neuronal assemblies is the higher-order correlation structure of the spiking activity of the participating neurons. Due to the rapid progress in recording technol...
Sonja Grün, Moshe Abeles, Markus Diesmann