Максимальный подсчет подграфа
method
ID: maximumsubgraph
Related Papers
Quasi-Second-Order Parsing for 1-Endpoint-Crossing, Pagenumber-2 Graphs
AbstractWe propose a new Maximum Subgraph algorithm for first-order parsing to 1-endpoint-crossing, pagenumber-2 graphs. Our algorithm has two characteristics: (1) it separates the construction for noncrossing edges and crossing edges; …...