Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs (Q5321692): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: DIMACS / rank | |||
Normal rank | |||
Revision as of 18:16, 29 February 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
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
