The following pages link to (Q4946041):
Displaying 19 items.
- Approximating the traffic grooming problem in tree and star networks (Q436821) (← links)
- Forwarding and optical indices of 4-regular circulant networks (Q891819) (← links)
- Forwarding and optical indices of a graph (Q1003676) (← links)
- Approximating the traffic grooming problem (Q1018099) (← links)
- Routing on networks of optical crossbars (Q1128720) (← links)
- Uniform multi-hop all-to-all optical routings in rings. (Q1401312) (← links)
- On routing of wavebands for all-to-all communications in all-optical paths and cycles (Q1770374) (← links)
- Optimal bandwidth utilization of all-optical ring with a converter of degree 4. (Q1850660) (← links)
- Spanning spiders and light-splitting switches (Q1877652) (← links)
- Minimizing ADMs on WDM directed fiber trees (Q1884302) (← links)
- Routing permutations and involutions on optical ring networks: Complexity results and solution to an open problem (Q2466024) (← links)
- Path problems in generalized stars, complete graphs, and brick wall graphs (Q2489960) (← links)
- (Q3433070) (← links)
- Optical Routing of Uniform Instances in Cayley Graphs (Q3438997) (← links)
- Analysis of Optimal Sets of Survivable Paths in Undirected Simple Graph Applicable for Optical Networks (Q3439300) (← links)
- An $\Omega(\sqrt{\,\log\log n}\,)$ Lower Bound for Routing in Optical Networks (Q4210085) (← links)
- (Q4791663) (← links)
- Structural Information and Communication Complexity (Q5315228) (← links)
- Selfish Routing and Path Coloring in All-Optical Networks (Q5458507) (← links)
