Up a level |
Schenker, Adam; Bunke, Horst; Last, Mark; Kandel, Abraham (2006). Polynomial Time Complexity Graph Distance Computation for Web Content Mining. In: Basu, Mitra; Ho, Kam Tin (eds.) Data Complexity in Pattern Recognition. Advanced Information and Knowledge Processing (pp. 197-215). Heidelberg: Springer Verlag