Results 1 
5 of
5
Fractional Path Coloring with Applications to WDM Networks
, 2001
"... This paper addresses the natural relaxation of the path coloring problem, in which one needs to color directed paths on a symmetric directed graph with a minimum number of colors, in such a way that paths using the same arc of the graph have different colors. This classic combinatorial problem finds ..."
Abstract

Cited by 20 (6 self)
 Add to MetaCart
(Show Context)
This paper addresses the natural relaxation of the path coloring problem, in which one needs to color directed paths on a symmetric directed graph with a minimum number of colors, in such a way that paths using the same arc of the graph have different colors. This classic combinatorial problem finds applications in the minimization of the number of wavelengths in wavelength division multiplexing (WDM) alloptical networks.
Updating Semantic Web Data
"... The basic data model for the Semantic Web is the Resource Description Framework (RDF). From a data management point of view, it resembles a lightweight knowledge base. In this paper we address updates in RDF. It is known that the semantics of updates for data models becomes unclear when the model tu ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
The basic data model for the Semantic Web is the Resource Description Framework (RDF). From a data management point of view, it resembles a lightweight knowledge base. In this paper we address updates in RDF. It is known that the semantics of updates for data models becomes unclear when the model turns, even slightly, more general than a simple relational structure. Viewing RDF as a knowledge base, and using the formalism of KatsunoMendelzon, we define semantics for updates in RDF. Then we show that RDF as a representation system does not have enough expressiveness to state updates satisfying the KatzunoMendelzon framework. Hence, we study the behavior of classical update operations in the framework of RDF, and propose versions of such updates based on approximations. Finally, we study how to compute these operations, which for erase are particularly complex, and give complexity bounds for them. 1.
Fractional Coloring of Bounded Degree Trees
, 2001
"... We study the dipathcoloring problem in bounded degree and treewidth symmetric digraphs, in which one needs to color the dipaths with a minimum number of colors, in such a way that dipaths using the same arc have different colors. This classic combinatorial problem finds applications in the minimiza ..."
Abstract
 Add to MetaCart
We study the dipathcoloring problem in bounded degree and treewidth symmetric digraphs, in which one needs to color the dipaths with a minimum number of colors, in such a way that dipaths using the same arc have different colors. This classic combinatorial problem finds applications in the minimization of the number of wavelengths in wavelength division multiplexing (wdm) all optical networks. In this paper, we prove
Fractional Path Coloring in Bounded Degree Trees with Applications
 ALGORITHMICA
, 2010
"... ..."
(Show Context)
Network Information Flow: Limits and A c h i eva bi li t y
"... Abstract An information theoretic upper bound on the information flow in discrete memoryless networks is found. The networks considered here can have multiple information sources and multiple sinks corresponding to each of the sources (which is also called as multicast). In the special case of net ..."
Abstract
 Add to MetaCart
Abstract An information theoretic upper bound on the information flow in discrete memoryless networks is found. The networks considered here can have multiple information sources and multiple sinks corresponding to each of the sources (which is also called as multicast). In the special case of networks with a single information source with multiple sinks, the bound coincides with the achievable region given in [l], and thus proves the optimality of the coding scheme proposed in it. I.