Пожалуйста, войдите в систему, чтобы принять участие в дискуссии (добавить собственные рецензию, или комментарий)
Цитировать эту публикацию
%0 Conference Paper
%1 conf/sspr/BunkeFGSV02
%A Bunke, Horst
%A Foggia, Pasquale
%A Guidobaldi, Corrado
%A Sansone, Carlo
%A Vento, Mario
%B SSPR/SPR
%D 2002
%E Caelli, Terry
%E Amin, Adnan
%E Duin, Robert P. W.
%E Kamel, Mohamed S.
%E de Ridder, Dick
%I Springer
%K dblp
%P 123-132
%T A Comparison of Algorithms for Maximum Common Subgraph on Randomly Connected Graphs.
%U http://dblp.uni-trier.de/db/conf/sspr/sspr2002.html#BunkeFGSV02
%V 2396
%@ 3-540-44011-9
@inproceedings{conf/sspr/BunkeFGSV02,
added-at = {2023-04-28T00:00:00.000+0200},
author = {Bunke, Horst and Foggia, Pasquale and Guidobaldi, Corrado and Sansone, Carlo and Vento, Mario},
biburl = {https://www.bibsonomy.org/bibtex/22ac0c9fa9ca581d723fffdcd8ba63b4a/dblp},
booktitle = {SSPR/SPR},
crossref = {conf/sspr/2002},
editor = {Caelli, Terry and Amin, Adnan and Duin, Robert P. W. and Kamel, Mohamed S. and de Ridder, Dick},
ee = {https://doi.org/10.1007/3-540-70659-3_12},
interhash = {1a28bc9ebc7aa34e4fc243cfdf4e0d1a},
intrahash = {2ac0c9fa9ca581d723fffdcd8ba63b4a},
isbn = {3-540-44011-9},
keywords = {dblp},
pages = {123-132},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
timestamp = {2024-04-10T07:02:24.000+0200},
title = {A Comparison of Algorithms for Maximum Common Subgraph on Randomly Connected Graphs.},
url = {http://dblp.uni-trier.de/db/conf/sspr/sspr2002.html#BunkeFGSV02},
volume = 2396,
year = 2002
}