{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:57:42Z","timestamp":1762102662432,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"JSPS","award":["18J23484"],"award-info":[{"award-number":["18J23484"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1007\/s10878-021-00799-x","type":"journal-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T20:02:42Z","timestamp":1630526562000},"page":"2871-2892","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the enumeration of minimal non-pairwise compatibility graphs"],"prefix":"10.1007","volume":"44","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7941-3419","authenticated-orcid":false,"given":"Naveed Ahmed","family":"Azam","sequence":"first","affiliation":[]},{"given":"Aleksandar","family":"Shurbevski","sequence":"additional","affiliation":[]},{"given":"Hiroshi","family":"Nagamochi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,1]]},"reference":[{"unstructured":"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","key":"799_CR1"},{"doi-asserted-by":"crossref","unstructured":"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\u2014Volume 3: BIOINFORMATICS","key":"799_CR2","DOI":"10.5220\/0008876801010108"},{"doi-asserted-by":"crossref","unstructured":"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","key":"799_CR3","DOI":"10.3390\/e22090923"},{"doi-asserted-by":"crossref","unstructured":"Azam NA, Shurbevski A, Nagamochi H (2020c) Enumerating tree-like graphs and polymer topologies with a given cycle rank. Entropy 22(11):1295","key":"799_CR4","DOI":"10.3390\/e22111295"},{"doi-asserted-by":"publisher","unstructured":"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","key":"799_CR5","DOI":"10.1016\/j.dam.2020.08.016"},{"doi-asserted-by":"crossref","unstructured":"Azam NA, Shurbevski A, Nagamochi H (2020e) On the enumeration of minimal non-pairwise compatibility graphs. In: International computing and combinatorics conference, pp 372\u2013383. Springer","key":"799_CR6","DOI":"10.1007\/978-3-030-58150-3_30"},{"key":"799_CR7","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.tcs.2019.05.017","volume":"791","author":"P Baiocchi","year":"2019","unstructured":"Baiocchi P, Calamoneri T, Monti A, Petreschi R (2019) Some classes of graphs that are not PCGs. Theor Comput Sci 791:62\u201375","journal-title":"Theor Comput Sci"},{"issue":"3","key":"799_CR8","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1137\/140978053","volume":"58","author":"T Calamoneri","year":"2016","unstructured":"Calamoneri T, Sinaimeri B (2016) Pairwise compatibility graphs: a survey. SIAM Rev 58(3):445\u2013460","journal-title":"SIAM Rev"},{"doi-asserted-by":"crossref","unstructured":"Calamoneri T, Frascaria D, Sinaimeri B (2013a) All graphs with at most seven vertices are pairwise compatibility graphs. Comput J 56(7):882\u2013886","key":"799_CR9","DOI":"10.1093\/comjnl\/bxs087"},{"doi-asserted-by":"crossref","unstructured":"Calamoneri T, Montefusco E, Petreschi R, Sinaimeri B (2013b) Exploring pairwise compatibility graphs. Theor Comput Sci 468:23\u201336","key":"799_CR10","DOI":"10.1016\/j.tcs.2012.11.015"},{"issue":"11","key":"799_CR11","doi-asserted-by":"publisher","first-page":"1616","DOI":"10.1093\/comjnl\/bxt068","volume":"57","author":"T Calamoneri","year":"2014","unstructured":"Calamoneri T, Frangioni A, Sinaimeri B (2014) Pairwise compatibility graphs of caterpillars. Comput J 57(11):1616\u20131623","journal-title":"Comput J"},{"key":"799_CR12","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.tcs.2015.01.011","volume":"571","author":"S Durocher","year":"2015","unstructured":"Durocher S, Mondal D, Rahman MS (2015) On graphs that are not PCGs. Theor Comput Sci 571:78\u201387","journal-title":"Theor Comput Sci"},{"key":"799_CR13","volume-title":"The theory of linear economic models","author":"D Gale","year":"1989","unstructured":"Gale D (1989) The theory of linear economic models. University of Chicago Press, Chicago"},{"doi-asserted-by":"crossref","unstructured":"Gugisch R, Kerber A, Kohnert A, Laue R, Meringer M, R\u00fccker C, Wassermann A (2015) MOLGEN 5.0, a molecular structure generator. In: Advances in mathematical chemistry and applications, pp 113\u2013138. Elsevier","key":"799_CR14","DOI":"10.2174\/9781608059287114010010"},{"unstructured":"http:\/\/users.cecs.anu.edu.au\/~bdm\/data\/graphs.html (visited on June, 2019)","key":"799_CR15"},{"doi-asserted-by":"publisher","unstructured":"Ito R, Azam NA, Wang C, Shurbevski A, Nagamochi H, Akutsu T (2021) A novel method for the inverse QSAR\/QSPR to monocyclic chemical compounds based on artificial neural networks and integer programming. In: Arabnia HR, Deligiannidis L, Shouno H, Tinetti FG, Tran QN (eds) Advances in computer vision and computational biology. Transactions on computational science and computational intelligence. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-030-71051-4_51","key":"799_CR16","DOI":"10.1007\/978-3-030-71051-4_51"},{"doi-asserted-by":"crossref","unstructured":"Kearney P, Munro JI, Phillips D (2003) Efficient generation of uniform samples from phylogenetic trees. In: International workshop on algorithms in bioinformatics, pp 177\u2013189. Springer","key":"799_CR17","DOI":"10.1007\/978-3-540-39763-2_14"},{"key":"799_CR18","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.jsc.2013.09.003","volume":"60","author":"BD McKay","year":"2014","unstructured":"McKay BD, Piperno A (2014) Practical graph isomorphism, II. J Symb Comput 60:94\u2013112","journal-title":"J Symb Comput"},{"issue":"1","key":"799_CR19","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1186\/1758-2946-4-21","volume":"4","author":"JE Peironcely","year":"2012","unstructured":"Peironcely JE, Rojas-Chert\u00f3 M, Fichera D, Reijmers T, Coulier L, Faulon J-L, Hankemeier T (2012) OMG: open molecule generator. J Cheminf 4(1):21","journal-title":"J Cheminf"},{"issue":"1","key":"799_CR20","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1186\/1758-2946-6-31","volume":"6","author":"M Suzuki","year":"2014","unstructured":"Suzuki M, Nagamochi H, Akutsu T (2014) Efficient enumeration of monocyclic chemical graphs with given path frequencies. J Cheminf 6(1):31","journal-title":"J Cheminf"},{"key":"799_CR21","doi-asserted-by":"publisher","first-page":"105875","DOI":"10.1016\/j.ipl.2019.105875","volume":"153","author":"M Xiao","year":"2020","unstructured":"Xiao M, Nagamochi H (2020) Some reduction operations to pairwise compatibility graphs. Inf Process Lett 153:105875","journal-title":"Inf Process Lett"},{"issue":"04","key":"799_CR22","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1142\/S1793830910000917","volume":"2","author":"MN Yanhaona","year":"2010","unstructured":"Yanhaona MN, Bayzid MS, Rahman MS (2010) Discovering pairwise compatibility graphs. Discrete Math Algorithms Appl 2(04):607\u2013623","journal-title":"Discrete Math Algorithms Appl"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00799-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-021-00799-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00799-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,14]],"date-time":"2022-10-14T20:22:22Z","timestamp":1665778942000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-021-00799-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,1]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["799"],"URL":"https:\/\/doi.org\/10.1007\/s10878-021-00799-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2021,9,1]]},"assertion":[{"value":"13 August 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 September 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}