A deterministic approach for rapid identification of the critical links in networks

We introduce a rapid deterministic algorithm for identification of the most critical links which are capable of causing network disruptions. The algorithm is based on searching for the shortest cycles in the network and provides a significant time improvement compared with a common brute-force algor...

Full description

Saved in:
Bibliographic Details
Published in:PloS one 2019-07, Vol.14 (7), p.e0219658-e0219658
Main Authors: Vodák, Rostislav, Bíl, Michal, Svoboda, Tomáš, Křivánková, Zuzana, Kubeček, Jan, Rebok, Tomáš, Hliněný, Petr
Format: Article
Language:English
Subjects:
Algorithms
Analysis
Computer and Information Sciences
Czech Republic
Data Collection
Deterministic models
Engineering and Technology
Humans
Identification
Links
Medicine and Health Sciences
Modern culture
Monte Carlo simulation
Nodes
Physical Sciences
Probability
Records
Research and Analysis Methods
Social Sciences
Software
Statistical analysis
Statistical analysis of data
Time
Transportation
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c692t-79c3d200313219532144ea04322d548ec4d18b0b04db1c548db136b7cee7a7063
cites cdi_FETCH-LOGICAL-c692t-79c3d200313219532144ea04322d548ec4d18b0b04db1c548db136b7cee7a7063
container_end_page e0219658
container_issue 7
container_start_page e0219658
container_title PloS one
container_volume 14
creator Vodák, Rostislav
Bíl, Michal
Svoboda, Tomáš
Křivánková, Zuzana
Kubeček, Jan
Rebok, Tomáš
Hliněný, Petr
description We introduce a rapid deterministic algorithm for identification of the most critical links which are capable of causing network disruptions. The algorithm is based on searching for the shortest cycles in the network and provides a significant time improvement compared with a common brute-force algorithm which scans the entire network. We used a simple measure, based on standard deviation, as a vulnerability measure. It takes into account the importance of nodes in particular network components. We demonstrate this approach on a real network with 734 nodes and 990 links. We found the worst scenarios for the cases with and without people living in the nodes. The evaluation of all network breakups can provide transportation planners and administrators with plenty of data for further statistical analyses. The presented approach provides an alternative approach to the recent research assessing the impacts of simultaneous interruptions of multiple links.
doi_str_mv 10.1371/journal.pone.0219658
format article
fullrecord <record><control><sourceid>gale_plos_</sourceid><recordid>TN_cdi_plos_journals_2259356459</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><galeid>A593632702</galeid><doaj_id>oai_doaj_org_article_ed2ee28f43f74780b3cacdfabb97cf64</doaj_id><sourcerecordid>A593632702</sourcerecordid><originalsourceid>FETCH-LOGICAL-c692t-79c3d200313219532144ea04322d548ec4d18b0b04db1c548db136b7cee7a7063</originalsourceid><addsrcrecordid>eNqNkl1r2zAUhs3YWNts_2BshkHZLpLpy5J9MwhlH4FCYd12K2TpKFHqWK5k7-PfT1ncEo9eDIMkjp7z6pzjN8teYLTAVOB3Wz-EVjWLzrewQARXvCgfZae4omTOCaKPj84n2VmMW4QKWnL-NDuhmGJWYnaaXS9zAz2EnWtd7J3OVdcFr_Qmtz7kQXXO5M5A2zvrtOqdb3Nv834DuQ4u8arJG9fexNy1eQv9Tx9u4rPsiVVNhOfjPsu-ffzw9eLz_PLq0-pieTnXvCL9XFSaGoJQKiZVX6SFMVCIUUJMwUrQzOCyRjVipsY6RdJGeS00gFACcTrLXh10u8ZHOc4jSkKKihacpXWWrQ6E8Woru-B2KvyWXjn5N-DDWqqQumhAgiEApLSMWsFEiWqqlTZW1XUltOUsab0fXxvqHRidZhJUMxGd3rRuI9f-h-SccsH25b4ZBYK_HSD2cueihqZRLfjhUHeFBWIooa__QR_ubqTWKjXgWuvTu3ovKpfpmlMiEEnU4gEqfQZ2TifzWJfik4S3k4TE9PCrX6shRrm6_vL_7NX3KXt-xG5ANf0m-mbYmypOQXYAdfAxBrD3Q8ZI7r1_Nw25974cvZ_SXh7_oPukO7PTPzEW_mQ</addsrcrecordid><sourcetype>Open Website</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2259356459</pqid></control><display><type>article</type><title>A deterministic approach for rapid identification of the critical links in networks</title><source>Open Access: PubMed Central</source><source>Publicly Available Content (ProQuest)</source><creator>Vodák, Rostislav ; Bíl, Michal ; Svoboda, Tomáš ; Křivánková, Zuzana ; Kubeček, Jan ; Rebok, Tomáš ; Hliněný, Petr</creator><contributor>Levinson, David M.</contributor><creatorcontrib>Vodák, Rostislav ; Bíl, Michal ; Svoboda, Tomáš ; Křivánková, Zuzana ; Kubeček, Jan ; Rebok, Tomáš ; Hliněný, Petr ; Levinson, David M.</creatorcontrib><description>We introduce a rapid deterministic algorithm for identification of the most critical links which are capable of causing network disruptions. The algorithm is based on searching for the shortest cycles in the network and provides a significant time improvement compared with a common brute-force algorithm which scans the entire network. We used a simple measure, based on standard deviation, as a vulnerability measure. It takes into account the importance of nodes in particular network components. We demonstrate this approach on a real network with 734 nodes and 990 links. We found the worst scenarios for the cases with and without people living in the nodes. The evaluation of all network breakups can provide transportation planners and administrators with plenty of data for further statistical analyses. The presented approach provides an alternative approach to the recent research assessing the impacts of simultaneous interruptions of multiple links.</description><identifier>ISSN: 1932-6203</identifier><identifier>EISSN: 1932-6203</identifier><identifier>DOI: 10.1371/journal.pone.0219658</identifier><identifier>PMID: 31314814</identifier><language>eng</language><publisher>United States: Public Library of Science</publisher><subject>Algorithms ; Analysis ; Computer and Information Sciences ; Czech Republic ; Data Collection ; Deterministic models ; Engineering and Technology ; Humans ; Identification ; Links ; Medicine and Health Sciences ; Modern culture ; Monte Carlo simulation ; Nodes ; Physical Sciences ; Probability ; Records ; Research and Analysis Methods ; Social Sciences ; Software ; Statistical analysis ; Statistical analysis of data ; Time ; Transportation</subject><ispartof>PloS one, 2019-07, Vol.14 (7), p.e0219658-e0219658</ispartof><rights>COPYRIGHT 2019 Public Library of Science</rights><rights>2019 Vodák et al. This is an open access article distributed under the terms of the Creative Commons Attribution License: http://creativecommons.org/licenses/by/4.0/ (the “License”), which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>2019 Vodák et al 2019 Vodák et al</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c692t-79c3d200313219532144ea04322d548ec4d18b0b04db1c548db136b7cee7a7063</citedby><cites>FETCH-LOGICAL-c692t-79c3d200313219532144ea04322d548ec4d18b0b04db1c548db136b7cee7a7063</cites><orcidid>0000-0002-0461-3109 ; 0000-0003-2125-1514</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.proquest.com/docview/2259356459/fulltextPDF?pq-origsite=primo$$EPDF$$P50$$Gproquest$$Hfree_for_read</linktopdf><linktohtml>$$Uhttps://www.proquest.com/docview/2259356459?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>230,314,723,776,780,881,25732,27903,27904,36991,36992,44569,53769,53771,74872</link.rule.ids><backlink>$$Uhttps://www.ncbi.nlm.nih.gov/pubmed/31314814$$D View this record in MEDLINE/PubMed$$Hfree_for_read</backlink></links><search><contributor>Levinson, David M.</contributor><creatorcontrib>Vodák, Rostislav</creatorcontrib><creatorcontrib>Bíl, Michal</creatorcontrib><creatorcontrib>Svoboda, Tomáš</creatorcontrib><creatorcontrib>Křivánková, Zuzana</creatorcontrib><creatorcontrib>Kubeček, Jan</creatorcontrib><creatorcontrib>Rebok, Tomáš</creatorcontrib><creatorcontrib>Hliněný, Petr</creatorcontrib><title>A deterministic approach for rapid identification of the critical links in networks</title><title>PloS one</title><addtitle>PLoS One</addtitle><description>We introduce a rapid deterministic algorithm for identification of the most critical links which are capable of causing network disruptions. The algorithm is based on searching for the shortest cycles in the network and provides a significant time improvement compared with a common brute-force algorithm which scans the entire network. We used a simple measure, based on standard deviation, as a vulnerability measure. It takes into account the importance of nodes in particular network components. We demonstrate this approach on a real network with 734 nodes and 990 links. We found the worst scenarios for the cases with and without people living in the nodes. The evaluation of all network breakups can provide transportation planners and administrators with plenty of data for further statistical analyses. The presented approach provides an alternative approach to the recent research assessing the impacts of simultaneous interruptions of multiple links.</description><subject>Algorithms</subject><subject>Analysis</subject><subject>Computer and Information Sciences</subject><subject>Czech Republic</subject><subject>Data Collection</subject><subject>Deterministic models</subject><subject>Engineering and Technology</subject><subject>Humans</subject><subject>Identification</subject><subject>Links</subject><subject>Medicine and Health Sciences</subject><subject>Modern culture</subject><subject>Monte Carlo simulation</subject><subject>Nodes</subject><subject>Physical Sciences</subject><subject>Probability</subject><subject>Records</subject><subject>Research and Analysis Methods</subject><subject>Social Sciences</subject><subject>Software</subject><subject>Statistical analysis</subject><subject>Statistical analysis of data</subject><subject>Time</subject><subject>Transportation</subject><issn>1932-6203</issn><issn>1932-6203</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><sourceid>DOA</sourceid><recordid>eNqNkl1r2zAUhs3YWNts_2BshkHZLpLpy5J9MwhlH4FCYd12K2TpKFHqWK5k7-PfT1ncEo9eDIMkjp7z6pzjN8teYLTAVOB3Wz-EVjWLzrewQARXvCgfZae4omTOCaKPj84n2VmMW4QKWnL-NDuhmGJWYnaaXS9zAz2EnWtd7J3OVdcFr_Qmtz7kQXXO5M5A2zvrtOqdb3Nv834DuQ4u8arJG9fexNy1eQv9Tx9u4rPsiVVNhOfjPsu-ffzw9eLz_PLq0-pieTnXvCL9XFSaGoJQKiZVX6SFMVCIUUJMwUrQzOCyRjVipsY6RdJGeS00gFACcTrLXh10u8ZHOc4jSkKKihacpXWWrQ6E8Woru-B2KvyWXjn5N-DDWqqQumhAgiEApLSMWsFEiWqqlTZW1XUltOUsab0fXxvqHRidZhJUMxGd3rRuI9f-h-SccsH25b4ZBYK_HSD2cueihqZRLfjhUHeFBWIooa__QR_ubqTWKjXgWuvTu3ovKpfpmlMiEEnU4gEqfQZ2TifzWJfik4S3k4TE9PCrX6shRrm6_vL_7NX3KXt-xG5ANf0m-mbYmypOQXYAdfAxBrD3Q8ZI7r1_Nw25974cvZ_SXh7_oPukO7PTPzEW_mQ</recordid><startdate>20190717</startdate><enddate>20190717</enddate><creator>Vodák, Rostislav</creator><creator>Bíl, Michal</creator><creator>Svoboda, Tomáš</creator><creator>Křivánková, Zuzana</creator><creator>Kubeček, Jan</creator><creator>Rebok, Tomáš</creator><creator>Hliněný, Petr</creator><general>Public Library of Science</general><general>Public Library of Science (PLoS)</general><scope>CGR</scope><scope>CUY</scope><scope>CVF</scope><scope>ECM</scope><scope>EIF</scope><scope>NPM</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>IOV</scope><scope>ISR</scope><scope>3V.</scope><scope>7QG</scope><scope>7QL</scope><scope>7QO</scope><scope>7RV</scope><scope>7SN</scope><scope>7SS</scope><scope>7T5</scope><scope>7TG</scope><scope>7TM</scope><scope>7U9</scope><scope>7X2</scope><scope>7X7</scope><scope>7XB</scope><scope>88E</scope><scope>8AO</scope><scope>8C1</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FH</scope><scope>8FI</scope><scope>8FJ</scope><scope>8FK</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AEUYN</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>ATCPS</scope><scope>AZQEC</scope><scope>BBNVY</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>BHPHI</scope><scope>C1K</scope><scope>CCPQU</scope><scope>D1I</scope><scope>DWQXO</scope><scope>FR3</scope><scope>FYUFA</scope><scope>GHDGH</scope><scope>GNUQQ</scope><scope>H94</scope><scope>HCIFZ</scope><scope>K9.</scope><scope>KB.</scope><scope>KB0</scope><scope>KL.</scope><scope>L6V</scope><scope>LK8</scope><scope>M0K</scope><scope>M0S</scope><scope>M1P</scope><scope>M7N</scope><scope>M7P</scope><scope>M7S</scope><scope>NAPCQ</scope><scope>P5Z</scope><scope>P62</scope><scope>P64</scope><scope>PATMY</scope><scope>PDBOC</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>PYCSY</scope><scope>RC3</scope><scope>7X8</scope><scope>5PM</scope><scope>DOA</scope><orcidid>https://orcid.org/0000-0002-0461-3109</orcidid><orcidid>https://orcid.org/0000-0003-2125-1514</orcidid></search><sort><creationdate>20190717</creationdate><title>A deterministic approach for rapid identification of the critical links in networks</title><author>Vodák, Rostislav ; Bíl, Michal ; Svoboda, Tomáš ; Křivánková, Zuzana ; Kubeček, Jan ; Rebok, Tomáš ; Hliněný, Petr</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c692t-79c3d200313219532144ea04322d548ec4d18b0b04db1c548db136b7cee7a7063</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Algorithms</topic><topic>Analysis</topic><topic>Computer and Information Sciences</topic><topic>Czech Republic</topic><topic>Data Collection</topic><topic>Deterministic models</topic><topic>Engineering and Technology</topic><topic>Humans</topic><topic>Identification</topic><topic>Links</topic><topic>Medicine and Health Sciences</topic><topic>Modern culture</topic><topic>Monte Carlo simulation</topic><topic>Nodes</topic><topic>Physical Sciences</topic><topic>Probability</topic><topic>Records</topic><topic>Research and Analysis Methods</topic><topic>Social Sciences</topic><topic>Software</topic><topic>Statistical analysis</topic><topic>Statistical analysis of data</topic><topic>Time</topic><topic>Transportation</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Vodák, Rostislav</creatorcontrib><creatorcontrib>Bíl, Michal</creatorcontrib><creatorcontrib>Svoboda, Tomáš</creatorcontrib><creatorcontrib>Křivánková, Zuzana</creatorcontrib><creatorcontrib>Kubeček, Jan</creatorcontrib><creatorcontrib>Rebok, Tomáš</creatorcontrib><creatorcontrib>Hliněný, Petr</creatorcontrib><collection>Medline</collection><collection>MEDLINE</collection><collection>MEDLINE (Ovid)</collection><collection>MEDLINE</collection><collection>MEDLINE</collection><collection>PubMed</collection><collection>CrossRef</collection><collection>Gale In Context: Opposing Viewpoints</collection><collection>Gale In Context: Science</collection><collection>ProQuest Central (Corporate)</collection><collection>Animal Behavior Abstracts</collection><collection>Bacteriology Abstracts (Microbiology B)</collection><collection>Biotechnology Research Abstracts</collection><collection>Nursing &amp; Allied Health Database</collection><collection>Ecology Abstracts</collection><collection>Entomology Abstracts (Full archive)</collection><collection>Immunology Abstracts</collection><collection>Meteorological &amp; Geoastrophysical Abstracts</collection><collection>Nucleic Acids Abstracts</collection><collection>Virology and AIDS Abstracts</collection><collection>Agricultural Science Collection</collection><collection>Health &amp; Medical Collection</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Medical Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Public Health Database</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Natural Science Collection</collection><collection>Hospital Premium Collection</collection><collection>Hospital Premium Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest One Sustainability</collection><collection>ProQuest Central</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>Agricultural &amp; Environmental Science Collection</collection><collection>ProQuest Central Essentials</collection><collection>Biological Science Collection</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest Natural Science Collection</collection><collection>Environmental Sciences and Pollution Management</collection><collection>ProQuest One Community College</collection><collection>ProQuest Materials Science Collection</collection><collection>ProQuest Central</collection><collection>Engineering Research Database</collection><collection>Health Research Premium Collection</collection><collection>Health Research Premium Collection (Alumni)</collection><collection>ProQuest Central Student</collection><collection>AIDS and Cancer Research Abstracts</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Health &amp; Medical Complete (Alumni)</collection><collection>ProQuest Materials Science Database</collection><collection>Nursing &amp; Allied Health Database (Alumni Edition)</collection><collection>Meteorological &amp; Geoastrophysical Abstracts - Academic</collection><collection>ProQuest Engineering Collection</collection><collection>Biological Sciences</collection><collection>Agriculture Science Database</collection><collection>Health &amp; Medical Collection (Alumni Edition)</collection><collection>Medical Database</collection><collection>Algology Mycology and Protozoology Abstracts (Microbiology C)</collection><collection>Biological Science Database</collection><collection>ProQuest Engineering Database</collection><collection>Nursing &amp; Allied Health Premium</collection><collection>ProQuest advanced technologies &amp; aerospace journals</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>Biotechnology and BioEngineering Abstracts</collection><collection>Environmental Science Database</collection><collection>Materials Science Collection</collection><collection>Publicly Available Content (ProQuest)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering collection</collection><collection>Environmental Science Collection</collection><collection>Genetics Abstracts</collection><collection>MEDLINE - Academic</collection><collection>PubMed Central (Full Participant titles)</collection><collection>DOAJ Directory of Open Access Journals</collection><jtitle>PloS one</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Vodák, Rostislav</au><au>Bíl, Michal</au><au>Svoboda, Tomáš</au><au>Křivánková, Zuzana</au><au>Kubeček, Jan</au><au>Rebok, Tomáš</au><au>Hliněný, Petr</au><au>Levinson, David M.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A deterministic approach for rapid identification of the critical links in networks</atitle><jtitle>PloS one</jtitle><addtitle>PLoS One</addtitle><date>2019-07-17</date><risdate>2019</risdate><volume>14</volume><issue>7</issue><spage>e0219658</spage><epage>e0219658</epage><pages>e0219658-e0219658</pages><issn>1932-6203</issn><eissn>1932-6203</eissn><abstract>We introduce a rapid deterministic algorithm for identification of the most critical links which are capable of causing network disruptions. The algorithm is based on searching for the shortest cycles in the network and provides a significant time improvement compared with a common brute-force algorithm which scans the entire network. We used a simple measure, based on standard deviation, as a vulnerability measure. It takes into account the importance of nodes in particular network components. We demonstrate this approach on a real network with 734 nodes and 990 links. We found the worst scenarios for the cases with and without people living in the nodes. The evaluation of all network breakups can provide transportation planners and administrators with plenty of data for further statistical analyses. The presented approach provides an alternative approach to the recent research assessing the impacts of simultaneous interruptions of multiple links.</abstract><cop>United States</cop><pub>Public Library of Science</pub><pmid>31314814</pmid><doi>10.1371/journal.pone.0219658</doi><tpages>e0219658</tpages><orcidid>https://orcid.org/0000-0002-0461-3109</orcidid><orcidid>https://orcid.org/0000-0003-2125-1514</orcidid><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 1932-6203
ispartof PloS one, 2019-07, Vol.14 (7), p.e0219658-e0219658
issn 1932-6203
1932-6203
language eng
recordid cdi_plos_journals_2259356459
source Open Access: PubMed Central; Publicly Available Content (ProQuest)
subjects Algorithms
Analysis
Computer and Information Sciences
Czech Republic
Data Collection
Deterministic models
Engineering and Technology
Humans
Identification
Links
Medicine and Health Sciences
Modern culture
Monte Carlo simulation
Nodes
Physical Sciences
Probability
Records
Research and Analysis Methods
Social Sciences
Software
Statistical analysis
Statistical analysis of data
Time
Transportation
title A deterministic approach for rapid identification of the critical links in networks
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-26T02%3A52%3A39IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-gale_plos_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20deterministic%20approach%20for%20rapid%20identification%20of%20the%20critical%20links%20in%20networks&rft.jtitle=PloS%20one&rft.au=Vod%C3%A1k,%20Rostislav&rft.date=2019-07-17&rft.volume=14&rft.issue=7&rft.spage=e0219658&rft.epage=e0219658&rft.pages=e0219658-e0219658&rft.issn=1932-6203&rft.eissn=1932-6203&rft_id=info:doi/10.1371/journal.pone.0219658&rft_dat=%3Cgale_plos_%3EA593632702%3C/gale_plos_%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c692t-79c3d200313219532144ea04322d548ec4d18b0b04db1c548db136b7cee7a7063%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2259356459&rft_id=info:pmid/31314814&rft_galeid=A593632702&rfr_iscdi=true