5100 search results - page 7 / 1020 » The Linear Complexity of a Graph |
OPODIS
2001
13 years 9 months ago
2001
In their pioneering paper [4], Gallager et al. introduced a distributed algorithm for constructing the minimum-weight spanning tree (MST), many authors have suggested ways to enhan...
SPAA
2010
ACM
13 years 6 months ago
2010
ACM
We describe parallel implementations of LU factorization with pivoting for multicore architectures. Implementations that differ in two different dimensions are discussed: (1) usin...
ENDM
2010
13 years 5 months ago
2010
In this paper we consider the structural analysis problem for differential-algebraic systems with conditional equations. This consists, given a conditional differential algebraic ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract-- This paper addresses the issue of design of lowrate sparse-graph codes with linear minimum distance in the blocklength. First, we define a necessary condition which need...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
— Medard, Finn, Barry and Gallager proposed an elegant recovery scheme (known as the MFBG scheme) using redundant trees. Xue, Chen and Thulasiraman extended the MFBG scheme and i...