Sciweavers

23 search results - page 2 / 5
» Minimal Cycle Bases of Outerplanar Graphs
Sort
View
SIROCCO
2001
13 years 8 months ago
Cycle Covering
This paper considers the design of a survivable WDM network based on covering the initial network with sub-networks, which are protected independently from each other. We focus on...
Jean-Claude Bermond, Lilian Chacon, David Coudert,...
ICPR
2010
IEEE
13 years 4 months ago
Object Tracking with Ratio Cycles Using Shape and Appearance Cues
We present a method for object tracking over time sequence imagery. The image plane is represented with a 4-connected planar graph where vertices are associated with pixels. On ea...
Mehmet Emre Sargin, Pratim Ghosh, B. S. Manjunath,...
NETWORKS
2007
13 years 6 months ago
Vertex disjoint routings of cycles over tori
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...
Jean-Claude Bermond, Min-Li Yu
NOMS
2010
IEEE
195views Communications» more  NOMS 2010»
13 years 5 months ago
Optimized network configuration parameter assignment based on graph coloring
The trend for future mobile networks is to move away from Network Elements (NEs) delivered with specially tailored configurations towards off-the-shelf products. The configurations...
Tobias Bandh, Georg Carle, Henning Sanneck, Lars-C...
IMCSIT
2010
13 years 5 months ago
On the implementation of public keys algorithms based on algebraic graphs over finite commutative rings
We will consider balanced directed graphs, i.e., graphs of binary relations, for which the number of inputs and number of outputs are the same for each vertex. The commutative diag...
Michal Klisowski, Vasyl Ustimenko