Sciweavers

2322 search results - page 114 / 465
» On a game in directed graphs
Sort
View
EDBT
2010
ACM
138views Database» more  EDBT 2010»
15 years 11 months ago
How to authenticate graphs without leaking
Secure data sharing in multi-party environments requires that both authenticity and confidentiality of the data be assured. Digital signature schemes are commonly employed for au...
Ashish Kundu, Elisa Bertino
COMBINATORICS
2000
114views more  COMBINATORICS 2000»
15 years 6 months ago
Trees and Matchings
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on ...
Richard Kenyon, James Gary Propp, David Bruce Wils...
CORR
2008
Springer
58views Education» more  CORR 2008»
15 years 6 months ago
Some results on (a:b)-choosability
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...
Shai Gutner, Michael Tarsi
SIAMCO
2008
81views more  SIAMCO 2008»
15 years 6 months ago
Reaching a Consensus in a Dynamically Changing Environment: A Graphical Approach
This paper presents new graph-theoretic results appropriate to the analysis of a variety of consensus problems cast in dynamically changing environments. The concepts of rooted, s...
Ming Cao, A. Stephen Morse, Brian D. O. Anderson
FSTTCS
1998
Springer
15 years 10 months ago
Partial Order Reductions for Bisimulation Checking
Partial order methods have been introduced to avoid the state explosion problem in veri cation resulting from the representation of multiple interleavings of concurrent transitions...
Michaela Huhn, Peter Niebert, Heike Wehrheim