Optimal segmentation of directed graph and the minimum number of feedback arcs (Q1683994)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6815225
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal segmentation of directed graph and the minimum number of feedback arcs |
scientific article; zbMATH DE number 6815225 |
Statements
Optimal segmentation of directed graph and the minimum number of feedback arcs (English)
0 references
4 December 2017
0 references
feedback arc set
0 references
directed cycle
0 references
replica-symmetric
0 references
belief propagation
0 references
segmentation
0 references
mean field theory
0 references
algorithm
0 references
0 references
0 references
0 references
0 references
0.798108696937561
0 references
0.7818830013275146
0 references
0.775532066822052
0 references
0.7671508193016052
0 references
0.7657438516616821
0 references
