1729 search results - page 81 / 346 » Bound Graph Polysemy |
143
Voted
STACS
2009
Springer
15 years 11 months ago
2009
Springer
We analyze the structure of equilibria and the price of anarchy in the family of network creation games considered extensively in the past few years, which attempt to unify the net...
158
click to vote
GG
2004
Springer
15 years 10 months ago
2004
Springer
We propose to study two infinite graph transformations that we respectively call bounded and unbounded path transduction. These graph transformations are based on path substitutio...
146
Voted
SWAT
1994
Springer
15 years 9 months ago
1994
Springer
We present sequential and parallel algorithms for various embedding problems on bounded degree partial k-trees and k-connected partial k-trees these include subgraph isomorphism a...
103
Voted
CORR
2008
Springer
15 years 5 months ago
2008
Springer
A solution to a problem of Erdos, Rubin and Taylor is obtained by showing that if a graph G is (a : b)-choosable, and c/d > a/b, then G is not necessarily (c : d)-choosable. Th...
168
Voted
COMSNETS
2012
14 years 20 days ago
2012
—Recently, there has been significant research interest in leveraging social networks to defend against Sybil attacks. While much of this work may appear similar at first glanc...