Have a personal or library account? Click to login
Polynomial Time Algorithms for Variants of Graph Matching on Partial k-Trees Cover

Polynomial Time Algorithms for Variants of Graph Matching on Partial k-Trees

Foundations of Computing and Decision Sciences
Volume 41 (2016): Issue 3 (September 2016)
By:
Open Access
|Sep 2016

Authors

Takayuki Nagoya

nagoya@kankyo-u.ac.jp

DOI: https://doi.org/10.1515/fcds-2016-0010 | Journal eISSN: 2300-3405 | Journal ISSN: 0867-6356
Journal RSS Feed
Language: English
Page range: 163 - 181
Published on: Sep 24, 2016
Published by: Poznan University of Technology
In partnership with: Paradigm Publishing Services
Publication frequency: 4 times per year
Keywords:
graph isomorphism with restriction,
partial -trees,
polynomial time algorithm
Related subjects:
Computer sciences,
Artificial intelligence,
Software development

© 2016 Takayuki Nagoya, published by Poznan University of Technology
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Previous articleVolume 41 (2016): Issue 3 (September 2016)Next article