Empirical analysis of algorithms for the shortest negative cost cycle problem (Q1634773): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.1016/j.dam.2018.03.055 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2797804587 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-testing/correcting with applications to numerical problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast and Flexible Difference Constraint Propagation for DPLL(T) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4809071 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized algorithms for finding the shortest negative cost cycle in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of totally clairvoyant scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal length resolution refutations of difference constraint systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for optimal length resolution refutation in difference constraint systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5604434 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the negative cost girth problem in planar networks / rank
 
Normal rank

Latest revision as of 16:44, 17 July 2024

scientific article
Language Label Description Also known as
English
Empirical analysis of algorithms for the shortest negative cost cycle problem
scientific article

    Statements

    Empirical analysis of algorithms for the shortest negative cost cycle problem (English)
    0 references
    0 references
    18 December 2018
    0 references
    graph theory
    0 references
    single source shortest path
    0 references
    path width
    0 references
    cycle
    0 references
    distinct edge width
    0 references

    Identifiers