Sciweavers

1545 search results - page 10 / 309
» On tree congestion of graphs
Sort
View
ESA
2009
Springer
190views Algorithms» more  ESA 2009»
15 years 1 months ago
Polynomial-Time Algorithm for the Leafage of Chordal Graphs
Every chordal graph G can be represented as the intersection graph of a collection of subtrees of a host tree, the so-called tree model of G. The leafage l(G) of a connected chorda...
Michel Habib, Juraj Stacho
IV
2009
IEEE
128views Visualization» more  IV 2009»
15 years 4 months ago
Large Quasi-Tree Drawing: A Neighborhood Based Approach
In this paper, we present an algorithm to lay out a particular class of graphs coming from real case studies: the quasi-tree graph class. Protein and internet mappings projects ha...
Romain Bourqui, David Auber
CN
2006
79views more  CN 2006»
14 years 9 months ago
Explicit rate multicast congestion control
In this article, we propose a new single-rate end-to-end multicast congestion control scheme called Explicit Rate Multicast Congestion Control (ERMCC) based on a new metric, TRAC ...
Jiang Li, Murat Yuksel, Shivkumar Kalyanaraman
WINE
2009
Springer
171views Economy» more  WINE 2009»
15 years 4 months ago
The Impact of Social Ignorance on Weighted Congestion Games
We consider weighted linear congestion games, and investigate how social ignorance, namely lack of information about the presence of some players, affects the inefficiency of pure...
Dimitris Fotakis, Vasilis Gkatzelis, Alexis C. Kap...
102
Voted
MOBIHOC
2012
ACM
13 years 2 days ago
Spatial spectrum access game: nash equilibria and distributed learning
A key feature of wireless communications is the spatial reuse. However, the spatial aspect is not yet well understood for the purpose of designing efficient spectrum sharing mecha...
Xu Chen, Jianwei Huang