{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,14]],"date-time":"2024-11-14T05:20:40Z","timestamp":1731561640823,"version":"3.28.0"},"reference-count":25,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1016\/j.dam.2024.08.014","type":"journal-article","created":{"date-parts":[[2024,8,31]],"date-time":"2024-08-31T09:41:17Z","timestamp":1725097277000},"page":"1-21","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["On locally finite ordered rooted trees and their rooted subtrees"],"prefix":"10.1016","volume":"360","author":[{"given":"Geir","family":"Agnarsson","sequence":"first","affiliation":[]},{"given":"Elie","family":"Alhajjar","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-0392-5108","authenticated-orcid":false,"given":"Aleyah","family":"Dawkins","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2024.08.014_b1","series-title":"New Information and Communication Technologies for Knowledge Management in Organizations","first-page":"64","article-title":"The complexity of cyber attacks in a new layered-security model and the maximum-weight, rooted-subtree problem","author":"Agnarsson","year":"2015"},{"issue":"3","key":"10.1016\/j.dam.2024.08.014_b2","doi-asserted-by":"crossref","first-page":"591","DOI":"10.14232\/actacyb.22.3.2016.3","article-title":"On cyber attacks and the maximum-weight rooted-subtree problem","volume":"22","author":"Agnarsson","year":"2016","journal-title":"Acta Cybernet."},{"issue":"4","key":"10.1016\/j.dam.2024.08.014_b3","doi-asserted-by":"crossref","first-page":"735","DOI":"10.14232\/actacyb.22.4.2016.2","article-title":"The structure of rooted weighted trees modeling layered cyber-security systems","volume":"22","author":"Agnarsson","year":"2016","journal-title":"Acta Cybernet."},{"issue":"4","key":"10.1016\/j.dam.2024.08.014_b4","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1080\/00150517.1973.12430815","article-title":"Some doubly exponential sequences","volume":"11","author":"Aho","year":"1973","journal-title":"Fibonacci Quart."},{"issue":"2","key":"10.1016\/j.dam.2024.08.014_b5","doi-asserted-by":"crossref","first-page":"161","DOI":"10.2307\/1969503","article-title":"A decomposition theorem for partially ordered sets","volume":"51","author":"Dilworth","year":"1950","journal-title":"Ann. of Math. (2)"},{"key":"10.1016\/j.dam.2024.08.014_b6","first-page":"1","article-title":"Leaf-induced subtrees of leaf-Fibonacci trees","volume":"1","author":"Dossou-Olory","year":"2019","journal-title":"Discrete Math. Lett."},{"year":"2022","series-title":"On isomorphism classes of leaf-induced subtrees in topological trees","author":"Dossou-Olory","key":"10.1016\/j.dam.2024.08.014_b7"},{"article-title":"Computers and intractability: A guide to the theory of NP-completeness","year":"1979","author":"Garey","key":"10.1016\/j.dam.2024.08.014_b8"},{"key":"10.1016\/j.dam.2024.08.014_b9","series-title":"Concrete Mathematics","first-page":"xiv+657","author":"Graham","year":"1994"},{"year":"2023","author":"Greenlaw","key":"10.1016\/j.dam.2024.08.014_b10"},{"issue":"2","key":"10.1016\/j.dam.2024.08.014_b11","article-title":"Inequalities on the Lambert W function and hyperpower function","volume":"9","author":"Hoorfar","year":"2008","journal-title":"JIPAM. J. Inequal. Pure Appl. Math."},{"key":"10.1016\/j.dam.2024.08.014_b12","series-title":"2009 Annual Computer Security Applications Conference","first-page":"117","article-title":"Modeling modern network attacks and countermeasures using attack graphs","author":"Ingols","year":"2009"},{"key":"10.1016\/j.dam.2024.08.014_b13","article-title":"A review of attack graph and attack tree visual syntax in cyber security","volume":"35","author":"Lallie","year":"2020","journal-title":"Comp. Sci. Rev."},{"key":"10.1016\/j.dam.2024.08.014_b14","unstructured":"Johann\u00a0Heinrich Lambert, Online; https:\/\/en.wikipedia.org\/wiki\/Lambert_W_function. (Accessed 9 October 2023)."},{"key":"10.1016\/j.dam.2024.08.014_b15","unstructured":"Johann\u00a0Heinrich Lambert, Online; https:\/\/mathworld.wolfram.com\/LambertW-Function.html. (Accessed 9 October 2023)."},{"key":"10.1016\/j.dam.2024.08.014_b16","series-title":"MILCOM 2006-2006 IEEE Military Communications Conference","first-page":"1","article-title":"Validating and restoring defense in depth using attack graphs","author":"Lippmann","year":"2006"},{"key":"10.1016\/j.dam.2024.08.014_b17","doi-asserted-by":"crossref","first-page":"688","DOI":"10.1137\/0118062","article-title":"On the number of subtrees of a symmetric n-ary tree","volume":"18","author":"Matula","year":"1970","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/j.dam.2024.08.014_b18","series-title":"Information Security and Cryptology - ICISC 2005","first-page":"186","article-title":"Foundations of attack trees","author":"Mauw","year":"2006"},{"year":"2001","series-title":"Attack Modeling for Information Security and Survivability","author":"Moore","key":"10.1016\/j.dam.2024.08.014_b19"},{"year":"2022","series-title":"The on-line encyclopedia of integer sequences","author":"OEIS Foundation Inc.","key":"10.1016\/j.dam.2024.08.014_b20"},{"key":"10.1016\/j.dam.2024.08.014_b21","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02759805","article-title":"A proof of Dilworth\u2019s decomposition theorem for partially ordered sets","volume":"1","author":"Perles","year":"1963","journal-title":"Isr. J. Math."},{"year":"2007","series-title":"Guide to Intrusion Detection and Prevention Systems (IDPS)","author":"Scarfone","key":"10.1016\/j.dam.2024.08.014_b22"},{"issue":"12","key":"10.1016\/j.dam.2024.08.014_b23","article-title":"Attack trees","volume":"24","author":"Schneier","year":"1999","journal-title":"Dr. Dobb\u2019s J. Softw. Tools"},{"key":"10.1016\/j.dam.2024.08.014_b24","doi-asserted-by":"crossref","unstructured":"Laura\u00a0Painton Swiler, Carolina\u00a0Hernandez Phillips, Daniel\u00a0R. Ellis, Stefan Chakerian, Computer-attack graph generation tool, in: Proceedings DARPA Information Survivability Conference and Exposition II, Vol. 2, DISCEX\u201901, 2001, pp. 307\u2013321.","DOI":"10.1109\/DISCEX.2001.932182"},{"key":"10.1016\/j.dam.2024.08.014_b25","first-page":"xvi+307","article-title":"Combinatorics and partially ordered sets. Dimension theory","author":"Trotter","year":"1992"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X24003664?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X24003664?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,11,13]],"date-time":"2024-11-13T11:35:40Z","timestamp":1731497740000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X24003664"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1]]},"references-count":25,"alternative-id":["S0166218X24003664"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2024.08.014","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[2025,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On locally finite ordered rooted trees and their rooted subtrees","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2024.08.014","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2024 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}