Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Let G be an edge-colored connected graph. A path P is a proper path in G if no two adjacent edges of P are colored the same. If P… Expand
Is this relevant?
2010
2010
Packing coloring is a partitioning of the vertex set of a graph with the property that vertices in the i-th class have pairwise… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
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… Expand
Is this relevant?
2003
2003
Motivated by the problem of allocating optical bandwidth in tree–shaped WDM networks, we study the fractional path coloring… Expand
Is this relevant?
2001
2001
This paper addresses the natural relaxation of the path coloring problem, in which one needs to color directed paths on a… Expand
  • figure 1
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Abstract Modern high-performance communication networks pose a number of challenging problems concerning the efficient allocation… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2001
2001
This paper addresses the natural relaxation of the path coloring problem, in which one needs to color directed paths on a… Expand
  • figure 1
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… Expand
Is this relevant?
1998
1998
We study the power of randomization in the design of on-line graph coloring algorithms. No specific network topology for which… Expand
  • figure 1
  • figure 2
Is this relevant?
1996
1996
  • Yuval 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… Expand
Is this relevant?