Search Sciweavers | Sciweavers

2314 search results - page 27 / 463

» Minimal Partitions of a Graph

click to vote

ICALP
2007
Springer

105views Programming Languages» more ICALP 2007»

Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions

14 years 2 months ago

Download www.tau.ac.il

Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...

Noga Alon, Amin Coja-Oghlan, Hiêp Hàn...

claim paper

Read More »

click to vote

ASUNAM
2010
IEEE

208views Social Networks» more ASUNAM 2010»

COSI: Cloud Oriented Subgraph Identification in Massive Social Networks

13 years 10 months ago

Download lccd-content.umiacs.umd.edu

Subgraph matching is a key operation on graph data. Social network (SN) providers may want to find all subgraphs within their social network that "match" certain query gr...

Matthias Bröcheler, Andrea Pugliese, V. S. Su...

claim paper

Read More »

click to vote

IAT
2009
IEEE

124views Intelligent Agents» more IAT 2009»

Multi-a(ge)nt Graph Patrolling and Partitioning

14 years 9 days ago

Download www.cs.technion.ac.il

We introduce a novel multi agent patrolling algorithm inspired by the behavior of gas filled balloons. Very low capability ant-like agents are considered with the task of patrolli...

Yotam Elor, Alfred M. Bruckstein

claim paper

Read More »

click to vote

RSA
2006

87views more RSA 2006»

Addendum to "The Minimal Spanning Tree in a Complete Graph and a Functional Limit Theorem for Trees in a Random Graph"

13 years 8 months ago

Download www2.math.uu.se

Svante Janson, Johan Wästlund

claim paper

Read More »