Sciweavers

3268 search results - page 64 / 654
» The hub number of a graph
Sort
View
ICCTA
2007
IEEE
15 years 10 months ago
What Graphs can be Efficiently Represented by BDDs?
We have carried out experimental research into implicit representation of large graphs using reduced ordered binary decision diagrams (OBDDs). We experimentally show that for grap...
Changxing Dong, Paul Molitor
SIGMOD
2008
ACM
98views Database» more  SIGMOD 2008»
16 years 6 months ago
Damia: data mashups for intranet applications
Increasingly large numbers of situational applications are being created by enterprise business users as a by-product of solving day-to-day problems. In efforts to address the dem...
David E. Simmen, Mehmet Altinel, Volker Markl, Sri...
PETRA
2009
ACM
16 years 20 days ago
A technological infrastructure design for a pediatric oncology network
In Italy, the service of Pediatric oncology is very centralized and granted by high-specialized medical structures. In the Italian Regione Campania there are just few of such medi...
Aniello Murano
TON
2008
109views more  TON 2008»
15 years 6 months ago
On hierarchical traffic grooming in WDM networks
Abstract--The traffic grooming problem is of high practical importance in emerging wide-area wavelength division multiplexing (WDM) optical networks, yet it is intractable for any ...
Bensong Chen, George N. Rouskas, Rudra Dutta
SWAT
2010
Springer
250views Algorithms» more  SWAT 2010»
15 years 11 months ago
Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing
Given a permutation π of {1, . . . , n} and a positive integer k, we give an algorithm with running time 2O(k2 log k) nO(1) that decides whether π can be partitioned into at mos...
Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov...