Improved Time Bounds for All Pairs Non-decreasing Paths in General Digraphs (Q5002719): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
label / enlabel / en
 
Improved Time Bounds for All Pairs Non-decreasing Paths in General Digraphs
Property / cites work
 
Property / cites work: On the exponent of all pairs shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Applications of Baur-Strassen’s Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster algorithms for finding lowest common ancestors in directed acyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934691 / 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: Q4633847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Shoshan-Zwick Algorithm for the All-Pairs Shortest Path Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fibonacci heaps and their uses in improved network optimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: All pairs shortest distances for graphs with small integer length edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: All pairs shortest paths for graphs with small integer length edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4607951 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Powers of tensors and fast matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Letter to the Editor—A Variant on the Shortest-Route Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Weight Cycles and Triangles: Equivalences and Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Distance Queries and Cycle Counting by Frobenius Normal Form / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the all-pairs-shortest-path problem in unweighted undirected graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: All-pairs bottleneck paths in vertex weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a maximum weight triangle in n <sup>3-Δ</sup> time, with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the Smallest H-Subgraph in Real Weighted Graphs and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002808 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondecreasing paths in a weighted graph or / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplying matrices faster than coppersmith-winograd / rank
 
Normal rank
Property / cites work
 
Property / cites work: A shortest cycle for each vertex of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: All pairs shortest paths using bridging sets and rectangular matrix multiplication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: http://drops.dagstuhl.de/opus/volltexte/2018/9048/ / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2886888786 / rank
 
Normal rank
Property / title
 
Improved Time Bounds for All Pairs Non-decreasing Paths in General Digraphs (English)
Property / title: Improved Time Bounds for All Pairs Non-decreasing Paths in General Digraphs (English) / rank
 
Normal rank

Latest revision as of 10:00, 30 July 2024

scientific article; zbMATH DE number 7375971
Language Label Description Also known as
English
Improved Time Bounds for All Pairs Non-decreasing Paths in General Digraphs
scientific article; zbMATH DE number 7375971

    Statements

    0 references
    0 references
    0 references
    28 July 2021
    0 references
    graph algorithms
    0 references
    matrix multiplication
    0 references
    non-decreasing paths
    0 references
    0 references
    0 references
    0 references
    0 references
    Improved Time Bounds for All Pairs Non-decreasing Paths in General Digraphs (English)
    0 references

    Identifiers

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