图 书 馆开课单位--瑞士伯尔尼大学
1 1/1
1Bipartite Graph Matching for Computing the Edit Distance of Graphs [用于计算图形编辑距离的二分图匹配]
Kaspar Riesen(瑞士伯尔尼大学) In the field of structural pattern recognition graphs constitute a very common and powerful way of representing patterns. In contrast to string repres...
热度：133
Kaspar Riesen(瑞士伯尔尼大学) In the field of structural pattern recognition graphs constitute a very common and powerful way of representing patterns. In contrast to string repres...
热度：133
1 1/1