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
Full text not available from this repository. (Request a copy)
Official URL: http://dx.doi.org/10.1007/978-1-84628-172-3_10
Item Type: |
Book Section (Book Chapter) |
|---|---|
Division/Institute: |
08 Faculty of Science > Institute of Computer Science (INF) |
UniBE Contributor: |
Bunke, Horst |
Series: |
Advanced Information and Knowledge Processing |
Publisher: |
Springer Verlag |
Language: |
English |
Submitter: |
Factscience Import |
Date Deposited: |
04 Oct 2013 14:47 |
Last Modified: |
05 Dec 2022 14:14 |
URI: |
https://boris.unibe.ch/id/eprint/19382 (FactScience: 1954) |
Actions (login required)
 |
Edit item |