Improved distance queries and cycle counting by Frobenius normal form (Q2321929): Difference between revisions

From MaRDI portal
Changed an Item
Created claim: Wikidata QID (P12): Q92510040, #quickstatements; #temporary_batch_1722372779079
 
(3 intermediate revisions by 3 users not shown)
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.1007/s00224-018-9894-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2900560911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fine-grained complexity for sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding and counting given length cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: More algorithms for all-pairs shortest paths in weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with Its Laplacian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691133 / 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: Black box Frobenius decompositions over small fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Normal Forms and Dynamic Characteristic Polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3254327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474265 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689624 / 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: On product of companion matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rational solutions of singular linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Dynamic Algorithms for Algebraic Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: All-pairs shortest paths with a sublinear additive error / 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: Fast Probabilistic Algorithms for Verification of Polynomial Identities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undirected single-source shortest paths with positive integer weights in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4531744 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on Boolean Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster all-pairs shortest paths via circuit complexity / 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: Finding even cycles even faster / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3851616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: All pairs shortest paths using bridging sets and rectangular matrix multiplication / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q92510040 / rank
 
Normal rank

Latest revision as of 23:00, 30 July 2024

scientific article
Language Label Description Also known as
English
Improved distance queries and cycle counting by Frobenius normal form
scientific article

    Statements

    Improved distance queries and cycle counting by Frobenius normal form (English)
    0 references
    0 references
    0 references
    27 August 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    graph algorithms
    0 references
    Frobenius normal form
    0 references
    all-nodes shortest cycles
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references