Sublinear-time algorithms for tournament graphs
Year of publication: |
2011
|
---|---|
Authors: | Dantchev, Stefan ; Friedetzky, Tom ; Nagel, Lars |
Published in: |
Journal of combinatorial optimization. - Norwell, Mass. : Springer Science + Business Media, ISSN 1382-6905, ZDB-ID 1339574-9. - Vol. 22.2011, 3, p. 469-481
|
Subject: | Graphentheorie | Graph theory | Algorithmus | Algorithm | Extensives Spiel | Extensive form game |
-
Cooperation in networks and scheduling
Velzen, Bas van, (2005)
-
Fair elimination-type competitions
Arlegi, Ritxar, (2020)
-
Equivalence between graph-based and sequence-based extensive form games
Kline, J. Jude, (2016)
- More ...
-
Assistenzsysteme für die Entscheidungsunterstützung
Blutner, Doris, (2009)
-
Nutzungsmöglichkeiten der Workbench zur Unterstützung des Planungsprozesses von Güterverkehrszentren
Keßler, Stephan, (2009)
-
Scheduling shared continuous resources on many-cores
Althaus, Ernst, (2018)
- More ...