Skip to search formSkip to main contentSkip to account menu

Path coloring

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… 
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2008
2008
2007
2007
We study routing and path coloring problems in all-optical networks as non-cooperative games. We especially focus on oblivious… 
2006
2006
The path coloring problem is to assign the minimum number of colors to a given set of directed paths on a given symmetric digraph… 
2003
2003
Motivated by the problem of allocating optical bandwidth in tree–shaped WDM networks, we study the fractional path coloring… 
2003
2003
In a soft coloring of a graph, a few adjacent vertices may receive the same color. We study soft coloring in the distributed… 
2001
2001
This paper addresses the natural relaxation of the path coloring problem, in which one needs to color directed paths on a… 
2001
2001
This paper addresses the natural relaxation of the path coloring problem, in which one needs to color directed paths on a… 
2001
2001
A tree of rings is a network that is obtained by interconnecting rings in a tree structure such that any two rings share at most… 
1998
1998
We study the power of randomization in the design of on-line graph coloring algorithms. No specific network topology for which… 
Highly Cited
1996
Highly Cited
1996
  • Y. Rabani
  • Proceedings of 37th Conference on Foundations of…
  • 1996
  • Corpus ID: 13031919
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…