High‐Speed Minimum Cut Approximation in Dense Graph Using Compacted Pruned Tree
ABSTRACT Solutions for minimum cut of a graph have been widely used in many applications, but existing acceleration methods have almost reached their limits by optimizing algorithm logic or reducing graph data. Given the mapping between traversal trees and cuts in a graph, we propose to deal with th...
Uloženo v:
| Vydáno v: | Mathematical methods in the applied sciences Ročník 48; číslo 15; s. 14110 - 14120 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Freiburg
Wiley Subscription Services, Inc
01.10.2025
|
| Témata: | |
| ISSN: | 0170-4214, 1099-1476 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | ABSTRACT
Solutions for minimum cut of a graph have been widely used in many applications, but existing acceleration methods have almost reached their limits by optimizing algorithm logic or reducing graph data. Given the mapping between traversal trees and cuts in a graph, we propose to deal with the problem from a new perspective, namely, cut enumeration. The algorithm enumerates the cuts using the depth‐first traversal tree, locates the optimal tree per node with the smallest local cut, and compacts them for acceleration. Any node pair can be separated by compacted trees containing only one of them. Its serial implementation is validated to be effective in obtaining the accurate solution for 99.9% or more pairs of vertices in a graph. Its calculation time per pair is as low as a thousandth of that of the most efficient existing method, that is, several microseconds in a graph with tens of millions of edges using an off‐shelf computing node, thus serving as an effective heuristic for min‐cut approximation. |
|---|---|
| AbstractList | Solutions for minimum cut of a graph have been widely used in many applications, but existing acceleration methods have almost reached their limits by optimizing algorithm logic or reducing graph data. Given the mapping between traversal trees and cuts in a graph, we propose to deal with the problem from a new perspective, namely, cut enumeration. The algorithm enumerates the cuts using the depth‐first traversal tree, locates the optimal tree per node with the smallest local cut, and compacts them for acceleration. Any node pair can be separated by compacted trees containing only one of them. Its serial implementation is validated to be effective in obtaining the accurate solution for 99.9% or more pairs of vertices in a graph. Its calculation time per pair is as low as a thousandth of that of the most efficient existing method, that is, several microseconds in a graph with tens of millions of edges using an off‐shelf computing node, thus serving as an effective heuristic for min‐cut approximation. ABSTRACT Solutions for minimum cut of a graph have been widely used in many applications, but existing acceleration methods have almost reached their limits by optimizing algorithm logic or reducing graph data. Given the mapping between traversal trees and cuts in a graph, we propose to deal with the problem from a new perspective, namely, cut enumeration. The algorithm enumerates the cuts using the depth‐first traversal tree, locates the optimal tree per node with the smallest local cut, and compacts them for acceleration. Any node pair can be separated by compacted trees containing only one of them. Its serial implementation is validated to be effective in obtaining the accurate solution for 99.9% or more pairs of vertices in a graph. Its calculation time per pair is as low as a thousandth of that of the most efficient existing method, that is, several microseconds in a graph with tens of millions of edges using an off‐shelf computing node, thus serving as an effective heuristic for min‐cut approximation. |
| Author | Yao, Weibin Ma, Ronghua |
| Author_xml | – sequence: 1 givenname: Ronghua orcidid: 0009-0004-7446-6978 surname: Ma fullname: Ma, Ronghua email: maronghua2024@163.com organization: Zhengzhou Railway Vocational and Technical College – sequence: 2 givenname: Weibin surname: Yao fullname: Yao, Weibin organization: Ali Cloud Computing Co., Ltd |
| BookMark | eNp1kLFOwzAYhC1UJNrCwBtYYmJIazuuE49VgBapFSDa2XKTP62rxglOIujGI_CMPAkuYWW65bv7_7sB6tnSAkLXlIwoIWxcFHpEKRWTM9SnRMqA8kj0UJ_QiAScUX6BBnW9J4TElLI-epmb7e778-u1Asjw0lhTtAVO2gZPq8qVH6bQjSktNhbfga0Bz5yudnhdG7vFSVlUOm288dm11svKAVyi81wfarj60yFaP9yvknmweJo9JtNFkDLJJ4EOZbQRWogNA62FZBFEGxmHMMlFxvMMmIQ8ykicxVkackFprqNUcx3HLE5lFg7RTZfr33xroW7Uvmyd9SdVyLgkp_bMU7cdlbqyrh3kqnK-kzsqStRpMeUXU7-LeXbcse_mAMf_QbVcTjvHD_M7byM |
| Cites_doi | 10.1109/TCOMM.2019.2929757 10.1109/LCOMM.2020.3028620 10.1109/FOCS46700.2020.00017 10.1109/LCOMM.2018.2830786 10.1145/263867.263872 10.1109/TSG.2016.2565619 10.1016/j.adhoc.2017.01.006 10.1109/GrC.2012.6468649 10.1145/3406325.3451020 10.1145/3519270.3538429 10.1109/RBME.2018.2798701 10.1109/FOCS46700.2020.00019 10.1137/0109047 10.1145/2350190.2350198 10.1007/978-3-642-23094-3_16 10.1137/0219009 10.1016/j.dam.2011.06.030 10.1145/2628036 10.1109/FOCS52979.2021.00111 10.1007/978-1-84628-970-5 10.1109/CIS.2011.113 10.1137/1.9781611976496.9 10.1109/CVPRW50498.2020.00496 10.1007/s10878-018-0352-0 10.1145/3406325.3451114 |
| ContentType | Journal Article |
| Copyright | 2025 John Wiley & Sons Ltd. 2025 John Wiley & Sons, Ltd. |
| Copyright_xml | – notice: 2025 John Wiley & Sons Ltd. – notice: 2025 John Wiley & Sons, Ltd. |
| DBID | AAYXX CITATION 7TB 8FD FR3 JQ2 KR7 |
| DOI | 10.1002/mma.11165 |
| DatabaseName | CrossRef Mechanical & Transportation Engineering Abstracts Technology Research Database Engineering Research Database ProQuest Computer Science Collection Civil Engineering Abstracts |
| DatabaseTitle | CrossRef Civil Engineering Abstracts Engineering Research Database Technology Research Database Mechanical & Transportation Engineering Abstracts ProQuest Computer Science Collection |
| DatabaseTitleList | Civil Engineering Abstracts CrossRef |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Sciences (General) Mathematics |
| EISSN | 1099-1476 |
| EndPage | 14120 |
| ExternalDocumentID | 10_1002_mma_11165 MMA11165 |
| Genre | researchArticle |
| GrantInformation_xml | – fundername: The Scientific Research and Development Project of Zhengzhou Bureau Group Co., Ltd. funderid: no. 2024G18 |
| GroupedDBID | -~X .3N .GA .Y3 05W 0R~ 10A 1L6 1OB 1OC 1ZS 31~ 33P 3SF 3WU 4.4 50Y 50Z 51W 51X 52M 52N 52O 52P 52S 52T 52U 52W 52X 5GY 5VS 66C 702 7PT 8-0 8-1 8-3 8-4 8-5 8UM 930 A03 AAESR AAEVG AAHQN AAMMB AAMNL AANHP AANLZ AAONW AASGY AAXRX AAYCA AAZKR ABCQN ABCUV ABIJN ABJNI ABPVW ACAHQ ACBWZ ACCZN ACGFS ACIWK ACPOU ACRPL ACSCC ACXBN ACXQS ACYXJ ADBBV ADEOM ADIZJ ADKYN ADMGS ADNMO ADOZA ADXAS ADZMN AEFGJ AEIGN AEIMD AENEX AEUYR AEYWJ AFBPY AFFPM AFGKR AFWVQ AFZJQ AGHNM AGQPQ AGXDD AGYGG AHBTC AIDQK AIDYY AITYG AIURR AJXKR ALAGY ALMA_UNASSIGNED_HOLDINGS ALUQN ALVPJ AMBMR AMVHM AMYDB ASPBG ATUGU AUFTA AVWKF AZBYB AZFZN AZVAB BAFTC BDRZF BFHJK BHBCM BMNLL BMXJE BNHUX BROTX BRXPI BY8 CO8 CS3 D-E D-F DCZOG DPXWK DR2 DRFUL DRSTM DU5 EBS EJD F00 F01 F04 F5P FEDTE G-S G.N GBZZK GNP GODZA H.T H.X HBH HF~ HGLYW HHY HVGLF HZ~ IX1 J0M JPC KQQ LATKE LAW LC2 LC3 LEEKS LH4 LITHE LOXES LP6 LP7 LUTES LW6 LYRES M6O MEWTI MK4 MRFUL MRSTM MSFUL MSSTM MXFUL MXSTM N04 N05 NF~ O66 O9- OIG P2P P2W P2X P4D PALCI Q.N Q11 QB0 QRW R.K RIWAO RJQFR ROL RX1 RYL SAMSI SUPJJ UB1 V2E W8V W99 WBKPD WH7 WIB WIH WIK WOHZO WQJ WXSBR WYISQ XBAML XG1 XPP XV2 ZZTAW ~02 ~IA ~WT AAYXX AIQQE CITATION O8X 7TB 8FD FR3 JQ2 KR7 |
| ID | FETCH-LOGICAL-c2945-a397b6a66b2eaa6927e7b983e5f6d4fde29ef7d08d8dc34611fa7ca4a8828c9d3 |
| IEDL.DBID | DRFUL |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001511928200001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0170-4214 |
| IngestDate | Thu Sep 11 22:40:46 EDT 2025 Sat Nov 29 07:36:05 EST 2025 Tue Sep 09 09:50:29 EDT 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 15 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c2945-a397b6a66b2eaa6927e7b983e5f6d4fde29ef7d08d8dc34611fa7ca4a8828c9d3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0009-0004-7446-6978 |
| OpenAccessLink | https://onlinelibrary.wiley.com/doi/pdfdirect/10.1002/mma.11165 |
| PQID | 3249010992 |
| PQPubID | 1016386 |
| PageCount | 11 |
| ParticipantIDs | proquest_journals_3249010992 crossref_primary_10_1002_mma_11165 wiley_primary_10_1002_mma_11165_MMA11165 |
| PublicationCentury | 2000 |
| PublicationDate | October 2025 2025-10-00 20251001 |
| PublicationDateYYYYMMDD | 2025-10-01 |
| PublicationDate_xml | – month: 10 year: 2025 text: October 2025 |
| PublicationDecade | 2020 |
| PublicationPlace | Freiburg |
| PublicationPlace_xml | – name: Freiburg |
| PublicationTitle | Mathematical methods in the applied sciences |
| PublicationYear | 2025 |
| Publisher | Wiley Subscription Services, Inc |
| Publisher_xml | – name: Wiley Subscription Services, Inc |
| References | 2011; 159 2018; 9 2017; 59 2012 1997; 44 1990; 19 2019; 67 2019; 37 2008 2014; 57 2020; 25 1961; 9 2018; 11 2018; 22 e_1_2_12_4_1 e_1_2_12_3_1 e_1_2_12_6_1 e_1_2_12_5_1 e_1_2_12_19_1 e_1_2_12_18_1 e_1_2_12_2_1 e_1_2_12_17_1 e_1_2_12_16_1 e_1_2_12_20_1 e_1_2_12_21_1 e_1_2_12_22_1 e_1_2_12_23_1 e_1_2_12_24_1 e_1_2_12_25_1 e_1_2_12_26_1 e_1_2_12_27_1 e_1_2_12_28_1 e_1_2_12_29_1 e_1_2_12_15_1 e_1_2_12_14_1 e_1_2_12_13_1 e_1_2_12_12_1 e_1_2_12_8_1 e_1_2_12_11_1 e_1_2_12_7_1 e_1_2_12_10_1 e_1_2_12_9_1 |
| References_xml | – start-page: 1144 end-page: 1153 – volume: 9 start-page: 551 issue: 4 year: 1961 end-page: 570 article-title: Multi‐Terminal Network Flows publication-title: Journal of the Society for Industrial and Applied Mathematics – start-page: 1 year: 2012 end-page: 6 – start-page: 281 end-page: 291 – volume: 19 start-page: 143 issue: 1 year: 1990 end-page: 155 article-title: Very Simple Methods for All Pairs Network Flow Analysis publication-title: SIAM Journal on Computing – start-page: 1 end-page: 18 – start-page: 85 end-page: 92 – start-page: 482 end-page: 486 – start-page: 219 end-page: 232 – start-page: 651 end-page: 656 – volume: 59 start-page: 63 issue: 5 year: 2017 end-page: 70 article-title: A Maximum Flow Algorithm Based on Storage Time Aggregated Graph for Delay‐Tolerant Networks publication-title: Ad Hoc Networks – volume: 25 start-page: 455 issue: 2 year: 2020 end-page: 459 article-title: Minimum Cut Acceleration by Exploiting Tree‐Cut Injection for Upper Bound Estimation publication-title: IEEE Communications Letters – start-page: 105 end-page: 118 – volume: 159 start-page: 2187 issue: 17 year: 2011 end-page: 2203 article-title: Simplifying Maximum Flow Computations: The Effect of Shrinking and Good Initial Flows publication-title: Discrete Applied Mathematics – volume: 67 start-page: 6912 issue: 10 year: 2019 end-page: 6924 article-title: STAG‐Based QoS Support Routing Strategy for Multiple Missions Over the Satellite Networks publication-title: IEEE Transactions on Communications – start-page: 80 end-page: 85 – volume: 9 start-page: 777 issue: 2 year: 2018 end-page: 785 article-title: Power System Structural Vulnerability Assessment Based on an Improved Maximum Flow Approach publication-title: IEEE Transactions on Smart Grid – start-page: 384 end-page: 395 – start-page: 1 end-page: 57 – volume: 11 start-page: 112 year: 2018 end-page: 124 article-title: A Survey of Graph Cuts/Graph Search Based Medical Image Segmentation publication-title: IEEE Reviews in Biomedical Engineering – year: 2008 – volume: 57 start-page: 82 issue: 8 year: 2014 end-page: 89 article-title: Efficient Maximum Flow Algorithms publication-title: Communications of the ACM – start-page: 1124 end-page: 1134 – volume: 37 start-page: 1266 issue: 4 year: 2019 end-page: 1282 article-title: Speed Scaling on Parallel Processors With Migration publication-title: Journal of Combinatorial Optimization – volume: 22 start-page: 1330 issue: 7 year: 2018 end-page: 1333 article-title: SPLMax: Exploiting the Simple Path Introduced Locality for Maximum Flow Acceleration publication-title: IEEE Communications Letters – start-page: 976 end-page: 977 – volume: 44 start-page: 585 issue: 4 year: 1997 end-page: 591 article-title: A Simple Min‐Cut Algorithm publication-title: Journal of the ACM – ident: e_1_2_12_5_1 doi: 10.1109/TCOMM.2019.2929757 – ident: e_1_2_12_19_1 – ident: e_1_2_12_27_1 doi: 10.1109/LCOMM.2020.3028620 – ident: e_1_2_12_24_1 doi: 10.1109/FOCS46700.2020.00017 – ident: e_1_2_12_16_1 doi: 10.1109/LCOMM.2018.2830786 – ident: e_1_2_12_21_1 – ident: e_1_2_12_28_1 doi: 10.1145/263867.263872 – ident: e_1_2_12_7_1 doi: 10.1109/TSG.2016.2565619 – ident: e_1_2_12_6_1 doi: 10.1016/j.adhoc.2017.01.006 – ident: e_1_2_12_14_1 doi: 10.1109/GrC.2012.6468649 – ident: e_1_2_12_22_1 doi: 10.1145/3406325.3451020 – ident: e_1_2_12_20_1 doi: 10.1145/3519270.3538429 – ident: e_1_2_12_3_1 doi: 10.1109/RBME.2018.2798701 – ident: e_1_2_12_17_1 doi: 10.1109/FOCS46700.2020.00019 – ident: e_1_2_12_9_1 doi: 10.1137/0109047 – ident: e_1_2_12_13_1 doi: 10.1145/2350190.2350198 – ident: e_1_2_12_11_1 doi: 10.1007/978-3-642-23094-3_16 – ident: e_1_2_12_10_1 doi: 10.1137/0219009 – ident: e_1_2_12_12_1 doi: 10.1016/j.dam.2011.06.030 – ident: e_1_2_12_29_1 – ident: e_1_2_12_2_1 doi: 10.1145/2628036 – ident: e_1_2_12_18_1 doi: 10.1109/FOCS52979.2021.00111 – ident: e_1_2_12_26_1 doi: 10.1007/978-1-84628-970-5 – ident: e_1_2_12_15_1 doi: 10.1109/CIS.2011.113 – ident: e_1_2_12_23_1 doi: 10.1137/1.9781611976496.9 – ident: e_1_2_12_4_1 doi: 10.1109/CVPRW50498.2020.00496 – ident: e_1_2_12_8_1 doi: 10.1007/s10878-018-0352-0 – ident: e_1_2_12_25_1 doi: 10.1145/3406325.3451114 |
| SSID | ssj0008112 |
| Score | 2.3925588 |
| Snippet | ABSTRACT
Solutions for minimum cut of a graph have been widely used in many applications, but existing acceleration methods have almost reached their limits by... Solutions for minimum cut of a graph have been widely used in many applications, but existing acceleration methods have almost reached their limits by... |
| SourceID | proquest crossref wiley |
| SourceType | Aggregation Database Index Database Publisher |
| StartPage | 14110 |
| SubjectTerms | Acceleration algorithm acceleration Algorithms Apexes approximate algorithm Approximation Compacts depth‐first traversal Enumeration Graph theory minimum cut Nodes Optimization tree compacting |
| Title | High‐Speed Minimum Cut Approximation in Dense Graph Using Compacted Pruned Tree |
| URI | https://onlinelibrary.wiley.com/doi/abs/10.1002%2Fmma.11165 https://www.proquest.com/docview/3249010992 |
| Volume | 48 |
| WOSCitedRecordID | wos001511928200001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVWIB databaseName: Wiley Online Library - Journals customDbUrl: eissn: 1099-1476 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0008112 issn: 0170-4214 databaseCode: DRFUL dateStart: 19960101 isFulltext: true titleUrlDefault: https://onlinelibrary.wiley.com providerName: Wiley-Blackwell |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV25TsNAEB1BoICCGxEurRAFFBbxZk9RRUCgIIhTorP2suQiBsUJouQT-Ea-hPXaCVAgIdG5sC1rdt7MG-_sG4B9zZR1QtBIW6siIpiMFPVVq9BStTjXccx1GDbBr67E46O8noLj8VmYSh9i8sOtREaI1yXAlS6OvkRD-31V4p3RaZjB3m9pA2ZOb7sPl5NALOKw2VkqxEQEx2QsLNTCR5OHf6ajL475namGVNNd_NdHLsFCzTBRp3KJZZhy-QrM9ybyrMUKLNeILtBBLTt9uAo3ZcvHx9v73bNPaKiX5Vl_1EcnoyHqlLrjr1l1yBFlOTr1ta9D56XWNQo9ByiEFePZK7oejHzkRvcD59bgoXt2f3IR1QMXIoMloZHy5MQvHmMaO6WYxNxxLUXb0ZRZklqHpUu5bQkrrGkTFsep4kYR5Wm6MNK216GRP-VuAxBxjPJUGhqr1JeQRhIpsBLSYia0oWkT9sZ2T54rXY2kUlDGiTdaEozWhO3xiiQ1tIrEM0AZ9vNwEw6C7X9_QdLrdcLF5t9v3YI5XM74DQ1729AYDkZuB2bNyzArBru1j30CF0TUfw |
| linkProvider | Wiley-Blackwell |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LT9wwEB5RqNT2AF1oxRZoLdQDHCI2XscPicsK2FKxWdGySNwix3akHJKifaAe-Qn8xv4SbOexcEBC6i0Hx7LG8_jGHn8D8D2lUhvOoyDVWgaEUxHIyGatPBWyx1gahiz1zSbYeMxvbsTlChw3b2Eqfoj2wM1ZhvfXzsDdgfTRkjW0KKQzeBq9gTVi1cjq99rp7-H1qPXEPPS3nY4iJiA4JA2zUA8ftT8_j0dLkPkUqvpYM9z4v1V-hPUaY6JBpRQdWDHlJnyIW4LW2SZ0apueoYOaePpwC365oo9_9w9XtzakoTgv82JRoJPFHA0c8_jfvHrmiPISndrs16Afju0a-aoD5B2LsvgVXU4X1nejydSYT3A9PJucnAd1y4VAYUGiQFp4YreP0hQbKanAzLBU8L6JMqpJpg0WJmO6xzXXqk9oGGaSKUmkBepcCd3_DKvln9JsAyKGRiwTKgplZpNIJYjgWHKhMeWpirIu7DeCT24rZo2k4lDGiRVa4oXWhd1mS5LauGaJxYDC3-jhLhx44b88QRLHA__x5fVDv8G780k8SkY_xxc78B67jr--fG8XVufThdmDt-puns-mX2uFewTaAdhv |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1NbxMxEB2VBCF6KCQtakoAC3FID6tmHa8_JC5RQwCRRIEmUm4rr-2V9rDbKB8VR34Cv5FfUtu7ScoBqRK3PXhXq7HfzBt7_AbgQ0KlNpxHQaK1DAinIpCRzVp5ImSXsSQMWeKbTbDJhC8WYnoEH3d3YUp9iP2Gm0OG99cO4Gap06uDamieSwd4Gj2BOnFNZGpQH_wYzkd7T8xDf9rpJGICgkOyUxbq4qv9y3_HowPJfEhVfawZvvi_v3wJJxXHRP1yUTTgyBRNOB7vBVrXTWhUmF6jTiU8fXkK313Rx59fv2-WNqShcVZk-TZH19sN6jvl8Z9Zec0RZQUa2OzXoM9O7Rr5qgPkHYuy_BVNV1vru9FsZcwZzIefZtdfgqrlQqCwIFEgLT2x00dpgo2UVGBmWCJ4z0Qp1STVBguTMt3lmmvVIzQMU8mUJNISda6E7r2CWnFbmHNAxNCIpUJFoUxtEqkEERxLLjSmPFFR2oL3O8PHy1JZIy41lHFsjRZ7o7WgvZuSuALXOrYcUPgTPdyCjjf-vz8Qj8d9_3Dx-KHv4Nl0MIxHXyffXsNz7Br--uq9NtQ2q615A0_V3SZbr95W6-0en0HX6g |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=High%E2%80%90Speed+Minimum+Cut+Approximation+in+Dense+Graph+Using+Compacted+Pruned+Tree&rft.jtitle=Mathematical+methods+in+the+applied+sciences&rft.au=Ma%2C+Ronghua&rft.au=Yao%2C+Weibin&rft.date=2025-10-01&rft.issn=0170-4214&rft.eissn=1099-1476&rft.volume=48&rft.issue=15&rft.spage=14110&rft.epage=14120&rft_id=info:doi/10.1002%2Fmma.11165&rft.externalDBID=n%2Fa&rft.externalDocID=10_1002_mma_11165 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0170-4214&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0170-4214&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0170-4214&client=summon |