Polynomial Time Algorithms for Variants of Graph Matching on Partial k-Trees
By: Takayuki Nagoya
Authors
DOI: https://doi.org/10.1515/fcds-2016-0010 | Journal eISSN: 2300-3405 (formerly 0867-6356) | Journal ISSN: 0867-6356
Language: English
Page range: 163 - 181
Published online: Sep 24, 2016
Published in print: Sep 1, 2016
Published by: Poznan University of Technology
In partnership with: Paradigm Publishing Services
Related subjects:
© 2016 Takayuki Nagoya, published by Poznan University of Technology
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.