Path problems in generalized stars, complete graphs, and brick wall graphs

@article{Erlebach2006PathPI,
  title={Path problems in generalized stars, complete graphs, and brick wall graphs},
  author={Thomas Erlebach and Danica Vukadinovic},
  journal={Discrete Applied Mathematics},
  year={2006},
  volume={154},
  pages={673-683}
}
Path problems such as the maximum edge-disjoint paths problem, the path coloring problem, and the maximum path coloring problem are relevant for resource allocation in communication networks, in particular all-optical networks. In this paper, it is shown that maximum path coloring can be solved optimally in polynomial time for bidirected generalized stars, even in the weighted case. Furthermore, the maximum edge-disjoint paths problem is proved NP-hard for complete graphs (undirected or… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 32 references

Similar Papers

Loading similar papers…