Optimal algorithm for converting an acyclic digraph to a cluster (Q5068488)
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: Optimal algorithm for converting an acyclic digraph to a cluster |
scientific article; zbMATH DE number 7504247
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal algorithm for converting an acyclic digraph to a cluster |
scientific article; zbMATH DE number 7504247 |
Statements
6 April 2022
0 references
acyclic digraph
0 references
bipartite digraph
0 references
cluster
0 references
Hamiltonian cycle
0 references
feedback
0 references
minimal edge cover
0 references
0.7334924340248108
0 references
0.7180728912353516
0 references
0.7155928611755371
0 references
