Sciweavers

2283 search results - page 83 / 457
» Bounds of Graph Characteristics
Sort
View
ESA
2007
Springer
92views Algorithms» more  ESA 2007»
14 years 2 months ago
Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validation
Abstract. The small world phenomenon, a.k.a. the six degree of separation between individuals, was identified by Stanley Milgram at the end of the 60s. Milgram experiment demonstr...
Pierre Fraigniaud
AAAI
2010
13 years 9 months ago
Coalitional Structure Generation in Skill Games
We consider optimizing the coalition structure in Coalitional Skill Games (CSGs), a succinct representation of coalitional games (Bachrach and Rosenschein 2008). In CSGs, the valu...
Yoram Bachrach, Reshef Meir, Kyomin Jung, Pushmeet...
SPAA
2005
ACM
14 years 1 months ago
Name independent routing for growth bounded networks
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
Ittai Abraham, Dahlia Malkhi
DM
2006
77views more  DM 2006»
13 years 8 months ago
Strong edge-coloring of graphs with maximum degree 4 using 22 colors
In 1985, Erdos and Ne
Daniel W. Cranston
GBRPR
2007
Springer
14 years 2 months ago
Local Reasoning in Fuzzy Attribute Graphs for Optimizing Sequential Segmentation
Spatial relations play a crucial role in model-based image recognition and interpretation due to their stability compared to many other image appearance characteristics. Graphs are...
Geoffroy Fouquier, Jamal Atif, Isabelle Bloch