Publication:4228508
From MaRDI portal
zbMath0936.68073MaRDI QIDQ4228508
Yair Bartal, Stefano Leonardi, Amos Fiat
Publication date: 1 March 1999
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Relaxing the irrevocability requirement for online graph algorithms, Short length Menger's theorem and reliable optical routing, Online coloring of hypergraphs, Approximating call-scheduling makespan in all-optical networks, Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties, A preemptive algorithm for maximizing disjoint paths on trees, Scheduling multicasts on unit-capacity trees and meshes., Approximation algorithms for routing and call scheduling in all-optical chains and rings., On-line routing in all-optical networks, Online coloring a token graph, Advice complexity of maximum independent set in sparse and bipartite graphs, A Preemptive Algorithm for Maximizing Disjoint Paths on Trees, Competitive algorithms and lower bounds for online randomized call control in cellular networks