Sciweavers

1545 search results - page 9 / 309
» On tree congestion of graphs
Sort
View
ARSCOM
2007
191views more  ARSCOM 2007»
14 years 9 months ago
Binomial Identities Generated by Counting Spanning Trees
We partition the set of spanning trees contained in the complete graph Kn into spanning trees contained in the complete bipartite graph Ks,t. This relation will show that any prop...
Thomas Dale Porter

Book
1197views
16 years 7 months ago
Graph Theory with Applications
A classic book on graph theory.
J.A. Bondy and U.S.R. Murty
65
Voted
SWAT
2004
Springer
129views Algorithms» more  SWAT 2004»
15 years 3 months ago
Collective Tree Spanners of Graphs
In this paper we introduce a new notion of collective tree spanners. We say that a graph G = (V, E) admits a system of µ collective additive tree r-spanners if there is a system T...
Feodor F. Dragan, Chenyu Yan, Irina Lomonosov
ICIP
2006
IEEE
15 years 11 months ago
Congestion-Distortion Optimized Peer-to-Peer Video Streaming
In live peer-to-peer streaming, a video stream is transmitted to a large population of viewers, through the use of the uplink bandwidth of participating peers. This approach overc...
Eric Setton, Jeonghun Noh, Bernd Girod
DAM
2010
132views more  DAM 2010»
14 years 9 months ago
Homomorphisms of 2-edge-colored graphs
In this paper, we study homomorphisms of 2-edge-colored graphs, that is graphs with edges colored with two colors. We consider various graph classes (outerplanar graphs, partial 2...
Amanda Montejano, Pascal Ochem, Alexandre Pinlou, ...