Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs (Q5321692): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Q261361 / rank
Normal rank
 
Property / author
 
Property / author: K. Subramani and Vahan Mkrtchyan / rank
 
Normal rank
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.1007/978-3-642-02270-8_7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2140226761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Theory and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scaling Algorithms for the Shortest Paths Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474117 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471290 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:28, 1 July 2024

scientific article; zbMATH DE number 5578462
Language Label Description Also known as
English
Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs
scientific article; zbMATH DE number 5578462

    Statements

    Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs (English)
    0 references
    0 references
    0 references
    0 references
    14 July 2009
    0 references
    design of algorithms
    0 references
    undirected mgraph
    0 references
    negative cost cycle
    0 references
    matching problem
    0 references
    join problem
    0 references
    efficiency of algorithm
    0 references

    Identifiers