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