An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs (Q1075771): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0190(86)90021-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2038086027 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved time and space bounds for Boolean matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5616735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Asymptotic Complexity of Matrix Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for finding the transitive closure of a digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sensitive transitive closure algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing the transitive closure of a relation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5616737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cascade algorithm for the logical closure of a set of binary relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear expected-time algorithms for connectivity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic structures for transitive closure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient determination of the transitive closure of a directed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast expected time algorithm for Boolean matrix multiplication and transitive closure / rank
 
Normal rank
Property / cites work
 
Property / cites work: A transitive closure algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3267904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved transitive closure algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gaussian elimination is not optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experiences with some transitive closure algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modification of Warshall's algorithm for the transitive closure of binary relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on Boolean Matrices / rank
 
Normal rank

Latest revision as of 14:19, 17 June 2024

scientific article
Language Label Description Also known as
English
An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs
scientific article

    Statements

    An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs (English)
    0 references
    0 references
    0 references
    1986
    0 references
    0 references
    list processing
    0 references
    data structures
    0 references
    graph algorithms
    0 references
    directed graph
    0 references
    circuit-free graph
    0 references
    0 references