Economical graph discovery
Year of publication: |
2014
|
---|---|
Authors: | Alon, Noga ; Emek, Yuval ; Feldman, Michal ; Tennenholtz, Moshe |
Published in: |
Operations research. - Catonsville, MD : INFORMS, ISSN 0030-364X, ZDB-ID 123389-0. - Vol. 62.2014, 6, p. 1236-1246
|
Subject: | graph discovery | shortest path | congestion | cost sharing | Graphentheorie | Graph theory | Engpass | Bottleneck |
-
Embeddings of circulant networks
Rajasingh, Indra, (2013)
-
Embedding complete bipartite graph into grid with optimum congestion and wirelength
Greeni, A. Berin, (2017)
-
Exact wirelength of embedding chord graph into tree-based architectures
Parthiban, N., (2017)
- More ...
-
Alon, Noga, (2010)
-
Alon, Noga, (2010)
-
Strategyproof approximation mechanisms for location on networks
Alon, Noga, (2010)
- More ...