A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs (Q3613764)
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: A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs |
scientific article; zbMATH DE number 5528726
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs |
scientific article; zbMATH DE number 5528726 |
Statements
A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs (English)
0 references
12 March 2009
0 references
minimum cycle basis
0 references
directed graph
0 references
0.9664413928985596
0 references
0.959136724472046
0 references
0.9435093402862548
0 references
0.8960357904434204
0 references
