In graph theory, path coloring usually refers to one of two problems: * The problem of coloring a (multi)set of paths in graph , in such a way thatâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2011

2011

- Michael Lampis
- IPEC
- 2011

We study the well-known Max Path Coloring problem from a parameterized point of view, focusing on trees and low-treewidthâ€¦Â (More)

Is this relevant?

2010

2010

- Shira Kritchman
- 2010

An instance of the minimum path coloring problem (MPCP) specifies a graph G, and a list of pairs of vertices of G, (s1, t1), (s2â€¦Â (More)

Is this relevant?

2007

2007

- Ioannis Milis, Aris Pagourtzis, Katerina Potika
- CAAN
- 2007

We study routing and path coloring problems in all-optical networks as non-cooperative games. We especially focus on obliviousâ€¦Â (More)

Is this relevant?

2003

2003

- Xiaotie Deng, Guojun Li, Wenan Zang, Yi Zhou
- J. Algorithms
- 2003

A tree of rings is an undirected graph obtained from a tree by replacing each node of the tree with a cycle (called tree-nodeâ€¦Â (More)

Is this relevant?

2001

2001

- Thomas Erlebach, Klaus Jansen
- Theor. Comput. Sci.
- 2001

Modern high-performance communication networks pose a number of challenging problems concerning the e0cient allocation ofâ€¦Â (More)

Is this relevant?

2001

2001

- Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, StÃ©phane PÃ©rennes, HervÃ© Rivano
- ICALP
- 2001

This paper addresses the natural relaxation of the path coloring problem, in which one needs to color directed paths on aâ€¦Â (More)

Is this relevant?

2000

2000

Motivated by the problem of WDM routing in allâ€“optical networks, we study the following NPâ€“hard problem. We are given a directedâ€¦Â (More)

Is this relevant?

1998

1998

- Stefano Leonardi, Andrea Vitaletti
- RANDOM
- 1998

We study the power of randomization in the design of online path coloring algorithms. No specific network topology for whichâ€¦Â (More)

Is this relevant?

1996

1996

- Baruch Awerbuch, Rainer Gawlick, +23 authors Pre
- 1996

On-line admission control and circuit routing for high performance computing and communication. Primal-dual approximationâ€¦Â (More)

Is this relevant?

1996

1996

- Yuval Rabani
- FOCS
- 1996

In the minimum path coloring problem, we are given a list of pairs of vertices of a graph. We are asked to connect each pair by aâ€¦Â (More)

Is this relevant?