Efficient transitive closure of sparse matrices over closed semirings (Q2368941): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: DIMACS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2005.11.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2076508696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths algorithms: Theory and experimental evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix multiplication via arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398334 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Bounds on the Complexity of the Shortest Path Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic improvement of the Bellman-Ford algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for Shortest Paths in Sparse Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4276004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On practical algorithms for accelerated matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4130999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast context-free grammar parsing requires fast boolean matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: The algebraic structure of transitive closure and its application to attribute type signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gaussian elimination is not optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on Boolean Matrices / rank
 
Normal rank

Latest revision as of 12:10, 24 June 2024

scientific article
Language Label Description Also known as
English
Efficient transitive closure of sparse matrices over closed semirings
scientific article

    Statements

    Efficient transitive closure of sparse matrices over closed semirings (English)
    0 references
    0 references
    28 April 2006
    0 references
    Sparse matrix multiplication
    0 references
    Semirings
    0 references
    Dijkstra's algorithm
    0 references
    Typed feature logic
    0 references
    Parsing
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references