Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

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

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

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

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

2003

2003

Motivated by the problem of allocating optical bandwidth in tree–shaped WDM networks, we study the fractional path coloring… Expand

Highly Cited

2001

Highly Cited

2001

Abstract Modern high-performance communication networks pose a number of challenging problems concerning the efficient allocation… Expand

2001

2001

This paper addresses the natural relaxation of the path coloring problem, in which one needs to color directed paths on a… Expand

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

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

1998

1998

We study the power of randomization in the design of on-line graph coloring algorithms. No specific network topology for which… Expand

Highly Cited

1996

Highly Cited

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