1232 search results - page 172 / 247 » Digraphs: theory, algorithms and applications |
SMA
2003
ACM
14 years 2 months ago
2003
ACM
Dimensional reduction is a simplification technique that eliminates one or more dimensions from a boundary value problem. It results in significant computational savings with mini...
FSTTCS
2008
Springer
13 years 10 months ago
2008
Springer
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
WWW
2007
ACM
14 years 9 months ago
2007
ACM
[Extended Abstract] Ken Wakita Tokyo Institute of Technology 2-12-1 Ookayama, Meguro-ku Tokyo 152-8552, Japan wakita@is.titech.ac.jp Toshiyuki Tsurumi Tokyo Institute of Technolog...
STOC
2010
ACM
14 years 1 months ago
2010
ACM
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
PODC
2012
ACM
11 years 11 months ago
2012
ACM
The goal of Byzantine Broadcast (BB) is to allow a set of fault-free nodes to agree on information that a source node wants to broadcast to them, in the presence of Byzantine faul...