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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1994-2016
012319942016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
We study the well-known Max Path Coloring problem from a parameterized point of view, focusing on trees and low-treewidth… (More)
  • table 1
  • figure 1
Is this relevant?
2010
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)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
2007
We study routing and path coloring problems in all-optical networks as non-cooperative games. We especially focus on oblivious… (More)
  • figure 1
  • figure 2
Is this relevant?
2003
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
Modern high-performance communication networks pose a number of challenging problems concerning the e0cient allocation of… (More)
  • 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… (More)
  • 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… (More)
Is this relevant?
1998
1998
We study the power of randomization in the design of online path coloring algorithms. No specific network topology for which… (More)
  • figure 1
  • figure 2
Is this relevant?
1996
1996
On-line admission control and circuit routing for high performance computing and communication. Primal-dual approximation… (More)
Is this relevant?
1996
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?