Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

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

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

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

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

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

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

Is this relevant?