5100 search results - page 712 / 1020 » The Linear Complexity of a Graph |
178
click to vote
CAL
2002
15 years 6 months ago
2002
This paper presents an algorithm to find a worst-case traffic pattern for any oblivious routing algorithm on an arbitrary interconnection network topology. The linearity of channe...
181
click to vote
PC
2002
15 years 6 months ago
2002
We present a new parallel algorithm to compute an exact triangularization of large square or rectangular and dense or sparse matrices in any field. Using fast matrix multiplicatio...
191
click to vote
SIGMETRICS
2002
ACM
15 years 6 months ago
2002
ACM
We introduce a new methodology for the exact analysis of M/G/1-type Markov processes. The methodology uses basic, well-known results for Markov chains by exploiting the structure ...
159
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. The group isomorphism problem asks whether two given groups are isomorphic or not. Whereas the case where both groups are abelian is well understood and can be solved eff...
171
click to vote
CASC
2010
Springer
15 years 5 months ago
2010
Springer
We discuss the algorithms which, given a linear difference equation with rational function coefficients over a field k of characteristic 0, compute a polynomial U(x) ∈ k[x] (a ...