4744 search results - page 6 / 949 » Connected Computing |
ICALP
2010
Springer
13 years 11 months ago
2010
Springer
We present an O(m + n)-time algorithm that tests if a given directed graph is 2-vertex connected, where m is the number of arcs and n is the number of vertices. Based on this resul...
STOC
2003
ACM
14 years 7 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
TCOM
2008
13 years 7 months ago
2008
Most network operators have considered reducing Label Switched Routers (LSR) label spaces (i.e. the number of labels that can be used) as a means of simplifying management of under...
IPPS
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract--This paper explores the computation and communication overlap capabilities enabled by the new CORE-Direct hardware capabilities introduced in the InfiniBand (IB) Host Cha...
IADIS
2004
13 years 8 months ago
2004
The main objective of the CONNECT project is to develop an innovative pedagogical framework that attempts to blend formal and informal learning, proposing an educational reform to ...