AbstractThis paper surveys several alternative data structures and algorithms for multiplying sparse upper-triangular matrices over closed semirings, and evaluates their efficiency in computing transitive closures of matrices over the Boolean semiring. Two new variants are introduced that outperform previously known methods on a collection of large data-sets drawn from linguistic applications
Computing the transitive closure of a directed graph can be reduced to determining the transitive cl...
AbstractWe define a closure operation on semigroups of matrices over a skew field, and show that a s...
In this paper we introduce a general framework for casting fully dynamic transitive closure into the...
AbstractClosed semi-rings and the closure of matrices over closed semi-rings are defined and studied...
AbstractClosed semirings are algebraic structures that provide a unified approach to a number of see...
Closed semi-rings and the closure of matrices oven closed semirings are defined and studied. Closed...
Closed semirings are algebraic structures that provide a unified approach to a number of seemingly u...
with a broad background. Consider the problem to solve the algebraic path problem can be concluded t...
*-semirings are algebraic structures that provide a unified approach to several problem classes in c...
In this paper we introduce a general framework for casting fully dynamic transitive closure into the...
In this paper we introduce a general framework for casting fully dynamic transitive closure into the...
Forming the transitive closure of a binary relation (or directed graph) is an important part of many...
This paper proposes a set of Level 3 Basic Linear Algebra Subprograms and associated kernels for sp...
Given a rectangular matrix with more columns than rows, find a base of linear combinations of the ro...
AbstractGiven a continuous semiring A and a collection H of semiring morphisms mapping the elements ...
Computing the transitive closure of a directed graph can be reduced to determining the transitive cl...
AbstractWe define a closure operation on semigroups of matrices over a skew field, and show that a s...
In this paper we introduce a general framework for casting fully dynamic transitive closure into the...
AbstractClosed semi-rings and the closure of matrices over closed semi-rings are defined and studied...
AbstractClosed semirings are algebraic structures that provide a unified approach to a number of see...
Closed semi-rings and the closure of matrices oven closed semirings are defined and studied. Closed...
Closed semirings are algebraic structures that provide a unified approach to a number of seemingly u...
with a broad background. Consider the problem to solve the algebraic path problem can be concluded t...
*-semirings are algebraic structures that provide a unified approach to several problem classes in c...
In this paper we introduce a general framework for casting fully dynamic transitive closure into the...
In this paper we introduce a general framework for casting fully dynamic transitive closure into the...
Forming the transitive closure of a binary relation (or directed graph) is an important part of many...
This paper proposes a set of Level 3 Basic Linear Algebra Subprograms and associated kernels for sp...
Given a rectangular matrix with more columns than rows, find a base of linear combinations of the ro...
AbstractGiven a continuous semiring A and a collection H of semiring morphisms mapping the elements ...
Computing the transitive closure of a directed graph can be reduced to determining the transitive cl...
AbstractWe define a closure operation on semigroups of matrices over a skew field, and show that a s...
In this paper we introduce a general framework for casting fully dynamic transitive closure into the...
DOI
Add to ORKG