BibSonomy :: publication :: A Polynomial-Time Algorithm for Computing the Maximum Common Subgraph of Outerplanar Graphs of Bounded Degree.
URLDOITeX

publication post of dblp

discussion

(0)

resources (URL, PDF, ...)

URL:http://dblp.uni-trier.de/db/conf/mfcs/mfcs2012.html#AkutsuT12
internal link:
?
You can use this internal link to create references to this post in your discussions. Just copy this internal link and paste it in your discussion text.
BibTeX key:conf/mfcs/AkutsuT12
BibSonomy is offered by the KDE group of the University of Kassel, the DMIR group of the University of Würzburg, and the L3S Research Center, Germany. Privacy & Terms of Use - Contact