✦ LIBER ✦

A Faster Katz Status Score Algorithm

✍ Scribed by Kurt C. Foster; Stephen Q. Muth; John J. Potterat; Richard B. Rothenberg

Book ID: 110321713
Publisher: Springer US
Year: 2001
Tongue: English
Weight: 169 KB
Volume: 7
Category: Article
ISSN: 1381-298X
DOI: 10.1023/a:1013470632383

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A faster Galerkin boundary integral algo

A faster Galerkin boundary integral algorithm

✍ Gray, L. J. ;Griffith, B. E. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 101 KB

The symmetry present in Green's functions is exploited to signi®cantly reduce the matrix assembly time for a Galerkin boundary integral analysis. A relatively simple modi®cation of the standard Galerkin implementation for computing the non-singular integrals yields a 20±30 per cent decrease in compu

A Faster Deterministic Maximum Flow Algo

A Faster Deterministic Maximum Flow Algorithm

✍ V. King; S. Rao; R. Tarjan 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 1011 KB

Cheriyan and Hagerup developed a randomized algorithm to compute the maximum flow in a graph with \(n\) nodes and \(m\) edges in \(O\left(m n+n^{2} \log ^{2} n\right)\) expected time. The randomization is used to efficiently play a certain combinatorial game that arises during the computation. We gi

A faster parametric minimum-cut algorith

A faster parametric minimum-cut algorithm

✍ Dan Gusfield; Éva Tardos 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 842 KB

A faster algorithm for betweenness centr

A faster algorithm for betweenness centrality*

✍ Brandes, Ulrik 📂 Article 📅 2001 🏛 Taylor and Francis Group 🌐 English ⚖ 621 KB

The betweenness centrality index is essential in the analysis of social networks, but costly to compute. Currently, the fastest known algorithms require (n 3 ) time and (n 2 ) space, where n is the number of actors in the network.Motivated by the fast-growing need to compute centrality indices on la

A faster scrabble move generation algori

A faster scrabble move generation algorithm

✍ Steven A. Gordon 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 840 KB

A practical algorithm for faster matrix

A practical algorithm for faster matrix multiplication

✍ Igor Kaporin 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 69 KB

The purpose of this paper is to present an algorithm for matrix multiplication based on a formula discovered by Pan [7]. For matrices of order up to 10 000, the nearly optimum tuning of the algorithm results in a rather clear non-recursive one-or two-level structure with the operation count comparab