Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference22 articles.
1. Azam NA, Ito M, Shurbevski A, Nagamochi H (2018) Enumerating all pairwise compatibility graphs with a given number of vertices based on linear programming. In: 2nd international workshop on enumeration problems and applications (WEPA), paper 6c
2. Azam NA, Chiewvanichakorn R, Zhang F, Shurbevski A, Nagamochi H, Akutsu T (2020a) A method for the inverse QSAR/QSPR based on artificial neural networks and mixed integer linear programming with guaranteed admissibility. In: Proceedings of the 13th international joint conference on biomedical engineering systems and technologies—Volume 3: BIOINFORMATICS
3. Azam NA, Shurbevski A, Nagamochi H (2020b) An efficient algorithm to count tree-like graphs with a given number of vertices and self-loops. Entropy 22(9):923
4. Azam NA, Shurbevski A, Nagamochi H (2020c) Enumerating tree-like graphs and polymer topologies with a given cycle rank. Entropy 22(11):1295
5. Azam NA, Shurbevski A, Nagamochi H (2020d) A method for enumerating pairwise compatibility graphs with a given number of vertices. Discret Appl Math. https://doi.org/10.1016/j.dam.2020.08.016
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献