Sciweavers

356 search results - page 39 / 72
» A Most General Edge Elimination Polynomial - Thickening of E...
Sort
View
IV
2009
IEEE
191views Visualization» more  IV 2009»
15 years 7 months ago
An Heuristic for the Construction of Intersection Graphs
Most methods for generating Euler diagrams describe the detection of the general structure of the final draw as the first and most important step. This information is often depi...
Paolo Simonetto, David Auber
86
Voted
ICALP
2010
Springer
15 years 5 months ago
Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests
The placement of regenerators in optical networks has become an active area of research during the last years. Given a set of lightpaths in a network G and a positive integer d, re...
George B. Mertzios, Ignasi Sau, Mordechai Shalom, ...
93
Voted
WDAG
2009
Springer
146views Algorithms» more  WDAG 2009»
15 years 7 months ago
Dynamics in Network Interaction Games
We study the convergence times of dynamics in games involving graphical relationships of players. Our model of local interaction games generalizes a variety of recently studied ga...
Martin Hoefer, Siddharth Suri
EJC
2010
15 years 15 days ago
Bijections for a class of labeled plane trees
We consider plane trees whose vertices are given labels from the set {1, 2, . . . , k} in such a way that the sum of the labels along any edge is at most k + 1; it turns out that ...
Nancy S. S. Gu, Helmut Prodinger, Stephan Wagner
91
Voted
ICPPW
2002
IEEE
15 years 5 months ago
Dynamic Expansion of M : N Protection Groups in GMPLS Optical Networks
Abstract— In order to provide reliable connections across metropolitan and wide-area optical networks, the network operator must provide some degree of redundancy so that traffic...
David W. Griffith, SuKyoung Lee