Sciweavers

1545 search results - page 26 / 309
» On tree congestion of graphs
Sort
View
IFL
1997
Springer
136views Formal Methods» more  IFL 1997»
15 years 1 months ago
Fully Persistent Graphs - Which One To Choose?
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...
Martin Erwig
IJCAI
2007
14 years 11 months ago
Multipotential Games
We introduce and analyze q-potential games and qcongestion games, where q is a positive integer. A 1-potential (congestion) game is a potential (congestion) game. We show that a g...
Dov Monderer
CORR
2004
Springer
92views Education» more  CORR 2004»
14 years 9 months ago
Embeddings into the Pancake Interconnection Network
Owing to its nice properties, the pancake is one of the Cayley graphs that were proposed as alternatives to the hypercube for interconnecting processors in parallel computers. In ...
Christian Lavault
ICMCS
2007
IEEE
158views Multimedia» more  ICMCS 2007»
15 years 4 months ago
Content-Aware P2P Video Streaming with Low Latency
This paper describes the Stanford P2P Multicast (SPPM) streaming system that employs an overlay architecture specifically designed for low delay video applications. In order to p...
Pierpaolo Baccichet, Jeonghun Noh, Eric Setton, Be...
ENTCS
2006
117views more  ENTCS 2006»
14 years 9 months ago
Distributed Graph Traversals by Relabelling Systems with Applications
Graph traversals are in the basis of many distributed algorithms. In this paper, we use graph relabelling systems to encode two basic graph traversals which are the broadcast and ...
Bilel Derbel, Mohamed Mosbah