Pages that link to "Item:Q2817603"
From MaRDI portal
The following pages link to Efficient routing in all-optical networks (Q2817603):
Displaying 50 items.
- Short length Menger's theorem and reliable optical routing (Q557907) (← links)
- Communication models for a free-space optical cross-connect switch (Q704676) (← links)
- Maximizing profits of routing in WDM networks (Q813327) (← links)
- APOSN: operation, modeling and performance evaluation (Q870400) (← links)
- Approximating call-scheduling makespan in all-optical networks (Q876731) (← links)
- The maximum edge-disjoint paths problem in complete graphs (Q930909) (← links)
- Inapproximability and approximability of minimal tree routing and coloring (Q935848) (← links)
- A Bayesian decision theory approach for the techno-economic analysis of an all-optical router (extended version) (Q943810) (← links)
- 1.5-Approximation algorithm for weighted maximum routing and wavelength assignment on rings (Q976131) (← links)
- Forwarding and optical indices of a graph (Q1003676) (← links)
- Efficient algorithms for wavelength assignment on trees of rings (Q1028409) (← links)
- Nash equilibria in all-optical networks (Q1043952) (← links)
- Efficient delay routing (Q1128715) (← links)
- Routing on networks of optical crossbars (Q1128720) (← links)
- Approximations for the disjoint paths problem in high-diameter planar networks (Q1273862) (← links)
- Simple, efficient routing schemes for all-optical networks (Q1293922) (← links)
- Methods and problems of communication in usual networks (Q1339884) (← links)
- The permutation-path coloring problem on trees. (Q1401295) (← links)
- Uniform multi-hop all-to-all optical routings in rings. (Q1401312) (← links)
- Scheduling multicasts on unit-capacity trees and meshes. (Q1401961) (← links)
- Efficient collective communciation in optical networks (Q1575944) (← links)
- Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs (Q1605303) (← links)
- Routing and path multicoloring (Q1607124) (← links)
- Wavelength routing in optical networks of diameter two (Q1612298) (← links)
- Path multicoloring in spider graphs with even color multiplicity (Q1705690) (← links)
- Approximation algorithms for routing and call scheduling in all-optical chains and rings. (Q1853488) (← links)
- Randomized path coloring on binary trees. (Q1853533) (← links)
- Minimizing ADMs on WDM directed fiber trees (Q1884302) (← links)
- On-line routing in all-optical networks (Q1960517) (← links)
- Optimal wavelength routing on directed fiber trees (Q1960521) (← links)
- Multicolor routing in the undirected hypercube (Q1971219) (← links)
- Solving the maximum edge disjoint path problem using a modified Lagrangian particle swarm optimisation hybrid (Q2030326) (← links)
- A \(\frac{5}{2}\)-approximation algorithm for coloring rooted subtrees of a degree 3 tree (Q2185817) (← links)
- Path multicoloring with fewer colors in spiders and caterpillars (Q2460919) (← links)
- Finding edge-disjoint paths in networks: an ant colony optimization algorithm (Q2466394) (← links)
- Path problems in generalized stars, complete graphs, and brick wall graphs (Q2489960) (← links)
- Topological design and dimensioning of agile all-photonic networks (Q2576338) (← links)
- Minimizing maximum fiber requirement in optical networks (Q2581759) (← links)
- Improved algorithms for scheduling unsplittable flows on paths (Q2684488) (← links)
- Many-to-many edge-disjoint paths in \((n,k)\)-enhanced hypercube under three link-faulty hypotheses (Q2700790) (← links)
- A Refined Analysis of Online Path Coloring in Trees (Q2971164) (← links)
- Wavelength assignment in multifiber star networks (Q3057165) (← links)
- Efficient routing in optical networks (Q4371693) (← links)
- (Q4418643) (← links)
- Coloring all directed paths in a symmetric tree, with an application to optical networks (Q4539866) (← links)
- Colouring paths in directed symmetric trees with applications to WDM routing (Q4571981) (← links)
- On-line routing in all-optical networks (Q4571982) (← links)
- Selfish Routing and Path Coloring in All-Optical Networks (Q5458507) (← links)
- All-to-all wavelength-routing in all-optical compound networks (Q5937949) (← links)
- The complexity of path coloring and call scheduling (Q5941061) (← links)
