Stephen Warshall. A Theorem on Boolean Matrices. In Journal of the ACM, volume 9, pages 11--12. ACM Press, 1962. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
An Analyzer for Message - Sequence Charts Rajeev (Correct)
.... . The pair (e; f) is a timing conflict iff the interval T (e; f) is included in the interval [ Gammad ef ; d fe ] It is clear that the timed MSC analysis problem can be solved by computing the shortest paths in GM . To compute shortest paths, we use the classical dynamic programming algorithm [3, 11]. This immediately leads to the following theorem: Theorem 4.3 Given a timed MSC M with n events the timed MSC analysis problem is solvable in time O(n ) 5 An MSC Analysis Tool In this section, we briefly describe the features of the message sequence chart analyzer that we have implemented ....
S. Warshall. A theorem on boolean matrices. Journal of the ACM , 9 (1962), pp. 11-12.
Unknown - Ffl-Removal Algorithm For (Correct)
....general algorithm applies in this case since A ffl is acyclic. 3.2 Computation of ffl closures As noticed before, the computation of ffl closures is equivalent to that of all pairs shortest distances over the semiring K in A ffl . There exists a generalization of the algorithm of Floyd Warshall [3, 11] for computing the all pairs shortest distances over a semiring K under some general conditions [7] However, the running time complexity of that algorithm is cubic: T Phi T ) That algorithm works in particular with the semiring (R; 0; 1) when the weight of each cycle of A ....
S. Warshall. A theorem on boolean matrices. Journal of the ACM, 9(1):11--12, 1962.
The Context-Based Constraint Language Ccl For Components - Bubl (2002) (1 citation) (Correct)
....cp addressed in the context condition (a) Calculate the full transitive closure derivedvalues # cp (e) Many algorithms exist for calculating a transitive closure. A well known one is the Floyd Warshall algorithm. It was published by Floyd ( 25] and is based on one of Warshall s theorems ([61]) Its running time is cubed in the number of elements. Thus, all values values cp (e) directvalues cp (e) derivedvalues cp (e) of the context property name cp are identified. b) If values cp (e) don t match with the context condition, than don t select this element. Otherwise, select this ....
Stephan Warshall. A theorem on boolean matrices. Journal of the ACM, 9(1):11--12, 1962.
Generic Epsilon-Removal and Input Epsilon-Normalization Algorithms .. - Mohri (2000) (5 citations) (Correct)
....automaton B equivalent to A output of the removal algorithm. 3.2. Computation of closures As noticed before, the computation of closures is equivalent to that of all pairs shortest distances over the semiring K in A . There exists a generalization of the algorithm of Floyd Warshall [4, 12] for computing the all pairs shortest distances over a semiring K under some general conditions [8] However, the running time complexity of that algorithm is cubic: T T ) where T , and T denote the cost of , and closure operations in the semiring considered. The ....
S. Warshall. A theorem on boolean matrices. Journal of the ACM, 9(1):11-12, 1962. 15
Semiring Frameworks and Algorithms for Shortest-Distance Problems - Mohri (2002) (1 citation) (Correct)
....problems, k shortest distance problems, and other problems by using each time the appropriate semiring. The all pairs shortest distance problem is known as the algebraic path problem and has been studied by numerous authors in the past with semiring frameworks of varying degrees of generality [17, 18, 19, 4, 9, 35, 16, 41, 42, 7, 3, 2, 25] starting with the work of Stephen Kleene and his proof of the equivalence of finite automata and regular expressions [21] see [15] for a survey of the algebraic path problem) The axioms of the closed semirings presented by some of these authors were not correct [42, 7, 3, 2] These inaccuracies ....
S. Warshall, A Theorem on Boolean Matrices. Journal of the ACM 9 (1962) 1, 11--12.
A Parallel Algorithm For Transitive Closure - Cáceres, Song (Correct)
....equal to the product of the number of edges and vertices of D that are stored in p. 1 Introduction The problem of computing the transitive closure of a digraph was first considered in 1959 by B. Roy [15] and a variety of sequential algorithms to solve this problem have been proposed ever since [1, 2, 7, 8, 9, 14, 16, 19]. These sequential solutions, usually are based on the use of the adjacency matrix of the digraph, considered as a Boolean matrix or use the adjacency matrix in more directed terms as a problem representation [13] Parallel algorithms for this problem where presented by [10, 12] PRAM) 11] ....
S. Warshall, A theorem on Boolean matrices, J. Assoc. Comput. Mach. 9 (1962) 11-12. 5
On The PVM Computations of Transitive Closure - Chan, Gibbons, Pias, Rytter (Correct)
....expressions describing paths between pairs of states of the automaton) see [1] In this paper we show that the coarse grained computation of the TC problem can be also considered as an instance of the APP problem. The best known sequential algorithm for the TC problem is the Warshall algorithm [10] which works in cubic time. Our first algorithm uses a straightforward coarse grained parallel implementation of the TC algorithm, called Block Processing. Our second algorithm, Three Pass, is much more complicated and it uses the ideas of the Guibas Kung Thompson systolic algorithm [4] 2 The ....
S. Warshall, A Theorem on Boolean Matrices, J. Assoc. Comput. Mach. Vol 9 (1962)
A Parallel Algorithm for Transitive Closure - Caceres, Song (Correct)
....in p. KEY WORDS Parallel algorithm, transitive closure, graph algorithm, CGM, BSP 1 Introduction The problem of computing the transitive closure of a digraph was first considered in 1959 by B. Roy [15] and a variety of sequential algorithms to solve this problem have been proposed ever since [1, 2, 7, 8, 9, 14, 16, 19]. These sequential solutions, usually are based on the use of the adjacency matrix of the digraph, considered as a Boolean matrix or use the adjacency matrix in more directed terms as a problem representation [13] Parallel algorithms for this problem where presented by [10, 12] PRAM) 11] ....
S. Warshall, A theorem on Boolean matrices, J. Assoc. Comput. Mach. 9 (1962) 11-12.
An 'All Pairs Shortest Paths' Distributed Algorithm Using.. - Haldar (1993) (1 citation) (Correct)
....of Dijkstra [4] uses a greedy method, and requires O(n 2) time units, where n is the number of nodes in the network. This algorithm can be executed separately for each node to obtain all pairs shortest paths in O(n 3) time units. The all pairs shortest paths algorithm of Floyd and Warshall [6, 10] uses a dynamic programming strategy, taking O(n 3) time units. Although a centralized approach is simple, its message complexity is ) mn) where m is the number of edges in the network. There are various complexity measures for a distributed algorithm: message complexity, bit complexity, time ....
S. Warshall, 'A theorem on boolean matrices', Journal of the ACM, Vol.9(1), 1962,
A Technique for Variable Dependence Driven Loop Peeling - Song, Kavi (2002) (Correct)
....among variables. Based on the dependences among variables, we present two efficient algorithms to identify quasi invariant variables and quasi induction variables, and to compute their peeling lengths, respectively. The first algorithm exploits the well known algorithm presented by Warshall [22]. The time complexities of Warshall algorithm is O(n ) in the worst case, where n is the number of the variables assigned inside a given loop. When computing the peeling lengths of quasi invariant variables and quasi induction variables, we can exploit the well known algorithm of Floyd [10] for ....
Warshall S., "A theorem on Boolean matrices", Journal of the ACM, January 1962, Vol. 9, No. 1, pp.11-12.
Hardware/Software Codesign for All-Pairs Shortest-Paths.. - Reconfigurable.. (Correct)
No context found.
Stephen Warshall. A Theorem on Boolean Matrices. In Journal of the ACM, volume 9, pages 11--12. ACM Press, 1962.
Hardware/Software Integration for FPGA-based All-Pairs.. - Ananth (Correct)
No context found.
S. Warshall. A Theorem on Boolean Matrices. In Journal of the ACM, volume 9, pages 11--12, Jan. 1962.
Parallel FPGA-based All-Pairs Shortest-Paths in a Directed Graph - Ananth (2006) (Correct)
No context found.
S. Warshall. A Theorem on Boolean Matrices. In Journal of the ACM, volume 9, pages 11--12, Jan. 1962.
The Algebraic Structure of Attributed Type Signatures - Penn (2000) (4 citations) (Correct)
No context found.
Stephen Warshall. A theorem on Boolean matrices. Journal of the ACM, 9 (1):11--12, January 1962.
Efficient Relational Calculation for Software Analysis - Beyer, Noack, Lewerentz (2005) (Correct)
No context found.
S. Warshall, "A Theorem on Boolean Matrices," J. ACM, vol. 9, no. 1, pp. 11-12, 1962.
Unknown - (Correct)
No context found.
Warshall, S. A theorem on Boolean matrices. J. ACM 9, 1 (Jan. 1962), 11--12.
Recognizable Formal Power Series are '-Rational { An.. - Department Of Computer (Correct)
No context found.
S. Warshall. A Theorem on Boolean Matrices. JACM, 9(1):11-12, 1962. 18
Combinatorial Approximation Algorithms for Generalized Flow.. - Oldham (4 citations) (Correct)
No context found.
Stephen Warshall. A theorem on boolean matrices. Journal of the Association for Computing Machinery, 9(1):11--12, January 1962.
Postman Problems on Mixed Graphs - Mart (2003) (Correct)
No context found.
S. Warshall. A theorem on boolean matrices. J. ACM, 9:11--12, 1962.
Parallel Algorithms for the All-Sources Generalized Shortest.. - Oldham, Pratt (1999) (Correct)
No context found.
Stephen Warshall. A theorem on boolean matrices. Journal of the Association for Computing Machinery, 9(1):11-12, January 1962. 11
Trust Management for the Semantic Web - Matthew Richardson Rakesh (2003) (20 citations) (Correct)
No context found.
Warshall, S. (1962). A theorem on boolean matrices. Journal of the ACM, 9, 11-12.
Fast Algorithms for the Maximum Convolution Problem - Bussieck, Hassler.. (Correct)
No context found.
S.Warshall, A theorem on boolean matrices, Comm. ACM. 9(1), 1962, 11--12.
Confirming Configurations in EFSM Testing - Petrenko, Boroday, Groz (2004) (Correct)
No context found.
S. Warshall, "A Theorem on Boolean Matrices," J. ACM, vol. 9, pp. 11-12, 1962.
Combinatorial Approximation Algorithms for Generalized Flow.. - Oldham (1999) (4 citations) (Correct)
No context found.
Stephen Warshall. A theorem on boolean matrices. Journal of the Association for Computing Machinery, 9(1):11--12, January 1962.
Who's The Weakest Link? - Nikhil Devanur Richard (Correct)
No context found.
S. Warshall, A theorem on Boolean matrices, Journal of the ACM, 9, (1962), 11-21.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC