The following pages link to (Q4228508):
Displaying 13 items.
- Short length Menger's theorem and reliable optical routing (Q557907) (← links)
- Online coloring of hypergraphs (Q656575) (← links)
- Approximating call-scheduling makespan in all-optical networks (Q876731) (← links)
- Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties (Q955347) (← links)
- A preemptive algorithm for maximizing disjoint paths on trees (Q970615) (← links)
- Scheduling multicasts on unit-capacity trees and meshes. (Q1401961) (← links)
- Approximation algorithms for routing and call scheduling in all-optical chains and rings. (Q1853488) (← links)
- On-line routing in all-optical networks (Q1960517) (← links)
- Online coloring a token graph (Q2303438) (← links)
- Advice complexity of maximum independent set in sparse and bipartite graphs (Q2344218) (← links)
- A Preemptive Algorithm for Maximizing Disjoint Paths on Trees (Q3512469) (← links)
- Competitive algorithms and lower bounds for online randomized call control in cellular networks (Q3548724) (← links)
- Relaxing the irrevocability requirement for online graph algorithms (Q5918715) (← links)