Name
Title | ||
|---|---|---|
On Computing Tractable Variations of Unordered Tree Edit Distance with Network Algorithms. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/978-3-642-32090-3_19 | JSAI-isAI Workshops |
Field | DocType | Citations |
Edit distance,Complete bipartite graph,Combinatorics,Network algorithms,Computer science,Bipartite graph,Algorithm,Maximum flow problem,Tree edit distance,Time complexity | Conference | 2 |
PageRank | References | Authors |
0.40 | 11 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yoshiyuki Yamamoto | 1 | 2 | 0.40 |
| Kouichi Hirata | 2 | 130 | 32.04 |
| Tetsuji Kuboyama | 3 | 140 | 29.36 |