Sciweavers

73 search results - page 14 / 15
» Labeling Schemes for Vertex Connectivity
Sort
View
IPPS
2008
IEEE
14 years 2 months ago
SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...
David A. Bader, Kamesh Madduri
GLOBECOM
2007
IEEE
14 years 2 months ago
GMPLS-Based Hybrid 1+N Link Protection Over p-Cycles: Design and Performance
—In [1], the author introduced a strategy to use network coding on p-Cycles in order to provide 1+N protection for straddling connections and links against single link failures i...
Ahmed E. Kamal
ECWEB
2000
Springer
110views ECommerce» more  ECWEB 2000»
14 years 4 days ago
Secure PC-Franking for Everyone
PC franking systems allow customers to download postage value into their PCs and to print postage value onto envelopes or mailing labels by using regular desktop printers connected...
Gerrit Bleumer
OOPSLA
1989
Springer
13 years 12 months ago
Static Type Inference for Parametric Classes
Method inheritance and data abstraction are central features of objectoriented programming that are attained through a hierarchical organization of classes. Recent studies have sh...
Atsushi Ohori, Peter Buneman
JCO
2010
101views more  JCO 2010»
13 years 6 months ago
Separator-based data reduction for signed graph balancing
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
Falk Hüffner, Nadja Betzler, Rolf Niedermeier