Greedy Approximation Algorithms for Generalized Maximum Flow Problem towards Relation Extraction in Information Networks
DOI10.1007/978-3-642-45281-9_13zbMath1406.68089OpenAlexW127711544MaRDI QIDQ2864337
Yasuhito Asano, Masatoshi Yoshikawa, Yusuke Nojima
Publication date: 6 December 2013
Published in: Computational Geometry and Graphs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-45281-9_13
Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Signed and weighted graphs (05C22)
This page was built for publication: Greedy Approximation Algorithms for Generalized Maximum Flow Problem towards Relation Extraction in Information Networks
