Greedy approximation algorithms for generalized maximum flow problem towards relation extraction in information networks (Q2864337)
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: Greedy approximation algorithms for generalized maximum flow problem towards relation extraction in information networks |
scientific article; zbMATH DE number 6236296
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Greedy approximation algorithms for generalized maximum flow problem towards relation extraction in information networks |
scientific article; zbMATH DE number 6236296 |
Statements
Greedy Approximation Algorithms for Generalized Maximum Flow Problem towards Relation Extraction in Information Networks (English)
0 references
6 December 2013
0 references
0.7523321509361267
0 references
0.7245113849639893
0 references
0.7181949615478516
0 references
0.7122688889503479
0 references
