Fast algorithms for the undirected negative cost cycle detection problem (Q261362)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Fast algorithms for the undirected negative cost cycle detection problem |
scientific article; zbMATH DE number 6559781
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast algorithms for the undirected negative cost cycle detection problem |
scientific article; zbMATH DE number 6559781 |
Statements
Fast algorithms for the undirected negative cost cycle detection problem (English)
0 references
23 March 2016
0 references
negative cost cycle
0 references
undirected graphs
0 references
\(T\)-join
0 references
\(b\)-matching
0 references
all pairs shortest path
0 references
perfect matching
0 references
0 references
