Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Journal Article
%1 journals/jgaa/KriegeDM18
%A Kriege, Nils M.
%A Droschinsky, Andre
%A Mutzel, Petra
%D 2018
%J J. Graph Algorithms Appl.
%K dblp
%N 4
%P 607-616
%T A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs.
%U http://dblp.uni-trier.de/db/journals/jgaa/jgaa22.html#KriegeDM18
%V 22
@article{journals/jgaa/KriegeDM18,
added-at = {2019-01-15T00:00:00.000+0100},
author = {Kriege, Nils M. and Droschinsky, Andre and Mutzel, Petra},
biburl = {https://puma.ub.uni-stuttgart.de/bibtex/217563cf36066f510c3d825709a981fc9/dblp},
ee = {https://doi.org/10.7155/jgaa.00480},
interhash = {1ba9ad517c09ea3ab33da72b15071328},
intrahash = {17563cf36066f510c3d825709a981fc9},
journal = {J. Graph Algorithms Appl.},
keywords = {dblp},
number = 4,
pages = {607-616},
timestamp = {2019-09-27T07:35:56.000+0200},
title = {A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs.},
url = {http://dblp.uni-trier.de/db/journals/jgaa/jgaa22.html#KriegeDM18},
volume = 22,
year = 2018
}