{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T04:16:36Z","timestamp":1776312996793,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"15","license":[{"start":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T00:00:00Z","timestamp":1760400000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T00:00:00Z","timestamp":1760400000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"DOI":"10.1007\/s11227-025-07967-4","type":"journal-article","created":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T16:01:24Z","timestamp":1760457684000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient domination problem: a quantum computing approach"],"prefix":"10.1007","volume":"81","author":[{"given":"K. A.","family":"Vidya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Venugopal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,10,14]]},"reference":[{"key":"7967_CR1","unstructured":"Bange DW, Barkauskas AE, Slater PJ (1988) Efficient dominating sets in graphs. In: Applications of Discrete Mathematics, pp. 189\u2013199. SIAM, Philadelphia"},{"key":"7967_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0012-365X(95)00094-D","volume":"159","author":"DW Bange","year":"1996","unstructured":"Bange DW, Barkauskas AE, Host LH, Slater PJ (1996) Generalized domination and efficient domination in graphs. Discret Math 159:1\u201311","journal-title":"Discret Math"},{"key":"7967_CR3","volume-title":"Fundamentals of Domination in Graphs","author":"TW Haynes","year":"1998","unstructured":"Haynes TW, Hedetniemi ST, Slater PJ (1998) Fundamentals of Domination in Graphs. Marcel Dekker, New York"},{"issue":"3","key":"7967_CR4","doi-asserted-by":"crossref","first-page":"291","DOI":"10.7151\/dmgt.1282","volume":"25","author":"M Chellali","year":"2005","unstructured":"Chellali M, Khelladi A, Maffray F (2005) Exact double domination in graphs. Discuss Math Graph Theor 25(3):291\u2013302","journal-title":"Discuss Math Graph Theor"},{"key":"7967_CR5","first-page":"1","volume":"10","author":"B Chaluvaraju","year":"2007","unstructured":"Chaluvaraju B, Vidya KA (2007) Bi-efficient domination in graphs. Proc Jangjeon Math Soc 10:1","journal-title":"Proc Jangjeon Math Soc"},{"key":"7967_CR6","unstructured":"Khatibi M, Behtoei A (2024) Exact double domination in the generalized Sierpinski graphs. Accepted for publication in AUT Journal of Mathematics and Computing"},{"key":"7967_CR7","unstructured":"Behtoei A (2024) Exact double domination in subdivision, Mycielskian and middle graphs. Preprint at url https:\/\/arxiv.org\/abs\/2408.05783v1"},{"key":"7967_CR8","unstructured":"Vidya KA, Chaluvaraju B, Venugopal K (2025) Complexity issues of Bi-efficient domination in certain classes of graphs. Communicated"},{"issue":"22","key":"7967_CR9","doi-asserted-by":"crossref","first-page":"5188","DOI":"10.1103\/PhysRevLett.86.5188","volume":"86","author":"R Raussendorf","year":"2001","unstructured":"Raussendorf R, Briegel HJ (2001) A one-way quantum computer. Phys Rev Lett 86(22):5188\u20135191","journal-title":"Phys Rev Lett"},{"key":"7967_CR10","doi-asserted-by":"crossref","first-page":"1015","DOI":"10.22331\/q-2023-05-23-1015","volume":"7","author":"S Evered","year":"2023","unstructured":"Evered S, Appleby DM, Osborne TJ (2023) Quantum algorithms for combinatorial optimization. Quantum 7:1015","journal-title":"Quantum"},{"issue":"3","key":"7967_CR11","first-page":"45","volume":"12","author":"R Padmanaban","year":"2024","unstructured":"Padmanaban R (2024) Quantum computing for optimization problems. J Quantum Comput 12(3):45\u201360","journal-title":"J Quantum Comput"},{"key":"7967_CR12","unstructured":"Farhi E, Goldstone J, Gutmann S (2014) A quantum approximate optimization algorithm. Preprint at url https:\/\/arxiv.org\/abs\/1411.4028"},{"key":"7967_CR13","doi-asserted-by":"crossref","first-page":"734","DOI":"10.22331\/q-2022-06-13-734","volume":"6","author":"Y Zhang","year":"2022","unstructured":"Zhang Y, Cincio L, Negre CFA, Mniszewski SM, Coles PJ, Dub PA, Tretiak S, Anisimov PM (2022) Quantum algorithms for the minimum vertex cover problem. Quantum 6:734","journal-title":"Quantum"},{"issue":"1","key":"7967_CR14","first-page":"45","volume":"23","author":"H Zheng","year":"2024","unstructured":"Zheng H, Li Y, Wang X (2024) Quantum algorithms for perfect matching in graphs. Quantum Inf Process 23(1):45","journal-title":"Quantum Inf Process"},{"issue":"6","key":"7967_CR15","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1007\/s11128-017-1603-1","volume":"16","author":"G Chapuis","year":"2017","unstructured":"Chapuis G, Djidjev H, Hahn G (2017) Quantum algorithms for the maximum clique problem. Quantum Inf Process 16(6):152","journal-title":"Quantum Inf Process"},{"issue":"12","key":"7967_CR16","doi-asserted-by":"crossref","first-page":"1057","DOI":"10.3390\/e26121057","volume":"26","author":"H Pan","year":"2024","unstructured":"Pan H, Lu C (2024) Solving the independent domination problem by the quantum approximate optimization algorithm. Entropy 26(12):1057","journal-title":"Entropy"},{"key":"7967_CR17","unstructured":"Pan H, Wang S, Lu C (2024) Application of quantum approximate optimization algorithm in solving the total domination problem. Preprint at url https:\/\/arxiv.org\/abs\/2411.00364v2"},{"key":"7967_CR18","unstructured":"Glover F, Kochenberger G, Du Y (2022) A tutorial on formulating and using QUBO models. Preprint at url https:\/\/arxiv.org\/abs\/1811.11538"},{"issue":"2","key":"7967_CR19","volume":"103","author":"Z Wang","year":"2021","unstructured":"Wang Z, Hadfield S, Jiang Z, Rieffel EG (2021) Quantum approximate optimization algorithm for maxcut: a fermionic view. Phys Rev A 103(2):022408","journal-title":"Phys Rev A"},{"key":"7967_CR20","doi-asserted-by":"crossref","first-page":"9","DOI":"10.3390\/e24091196","volume":"24","author":"L Gyongyosi","year":"2022","unstructured":"Gyongyosi L (2022) Adaptive problem solving dynamics in gate-model quantum computers. Entropy 24:9","journal-title":"Entropy"},{"key":"7967_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s41598-020-79139-8","volume":"11","author":"L Gyongyosi","year":"2021","unstructured":"Gyongyosi L, Imre S (2021) Scalable distributed gate-model quantum computers. Sci Rep 11:1","journal-title":"Sci Rep"},{"issue":"1","key":"7967_CR22","doi-asserted-by":"crossref","first-page":"11229","DOI":"10.1038\/s41598-020-67014-5","volume":"10","author":"L Gyongyosi","year":"2020","unstructured":"Gyongyosi L, Imre S (2020) Circuit depth reduction for gate-model quantum computers. Sci Rep 10(1):11229","journal-title":"Sci Rep"},{"issue":"1","key":"7967_CR23","doi-asserted-by":"crossref","first-page":"4543","DOI":"10.1038\/s41598-020-61316-4","volume":"10","author":"L Gyongyosi","year":"2020","unstructured":"Gyongyosi L (2020) Quantum state optimization and computational pathway evaluation for gate-model quantum computers. Sci Rep 10(1):4543","journal-title":"Sci Rep"},{"issue":"8","key":"7967_CR24","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1145\/3524455","volume":"65","author":"L Gyongyosi","year":"2022","unstructured":"Gyongyosi L, Imre S (2022) Advances in the quantum internet. Commun ACM 65(8):52\u201363","journal-title":"Commun ACM"},{"issue":"2","key":"7967_CR25","first-page":"97","volume":"25","author":"L Gyongyosi","year":"2025","unstructured":"Gyongyosi L, Imre S (2025) Networked quantum services. Quantum Inf Comput 25(2):97\u2013140","journal-title":"Quantum Inf Comput"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-07967-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-025-07967-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-07967-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T16:01:29Z","timestamp":1760457689000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-025-07967-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,14]]},"references-count":25,"journal-issue":{"issue":"15","published-online":{"date-parts":[[2025,10]]}},"alternative-id":["7967"],"URL":"https:\/\/doi.org\/10.1007\/s11227-025-07967-4","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,14]]},"assertion":[{"value":"12 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 October 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 October 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"1461"}}