26 search results - page 4 / 6 » Edge Disjoint Graph Spanners of Complete Graphs and Complete... |
109
click to vote
NETWORKS
2007
14 years 11 months ago
2007
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...
101
click to vote
SIROCCO
2001
15 years 1 months ago
2001
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...
154
click to vote
WG
2010
Springer
14 years 10 months ago
2010
Springer
book Author Title 58 Bijo S Anand Atoms and clique separators in graph products 59 Asir T Domination in total graph of a commutative ring 60 Sharada B On the Neighbourhood Subdivi...
DAM
1999
14 years 11 months ago
1999
The Stacker-Crane Problem (SCP) isa sequencing problem, arising inscheduling and transportation, that consists of nding the minimum cost cycle on a mixed graph with oriented arcs ...
166
click to vote
AUSAI
2011
Springer
13 years 11 months ago
2011
Springer
Image feature selection (FS) is an important task which can affect the performance of image classification and recognition. In this paper, we present a feature selection algorithm ...