Проблема максимального подграфа

Вернуться к списку
task ID: maximumsubgraphproblem

Related Papers

Parsing to 1-Endpoint-Crossing, Pagenumber-2 Graphs

Authors: nan

Publication: TIPSTER (2017)

DOI: nan

AbstractWe study the Maximum Subgraph problem in deep dependency parsing. We consider two restrictions to deep dependency graphs: (a) 1-endpoint-crossing and (b) pagenumber-2. Our main contribution is an exact algorithm …...

36972