An optimal pruned traversal tree-based fast minimum cut solver in dense graph
As an important problem in graph theory, the minimum-cut (min-cut) problem has various applications in many related fields. Among many acceleration strategies, one commonly used strategy is preprocessing the original graph to facilitate the min-cut calculations. In this paper, an optimal pruned tree...
Saved in:
Published in | Information sciences Vol. 652; p. 119768 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Elsevier Inc
01.01.2024
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | As an important problem in graph theory, the minimum-cut (min-cut) problem has various applications in many related fields. Among many acceleration strategies, one commonly used strategy is preprocessing the original graph to facilitate the min-cut calculations. In this paper, an optimal pruned tree-based min-cut acceleration algorithm (PTMA) is proposed for the problem by exploiting the mapping between the cuts and pruned depth-first traversal trees, which has not yet been investigated in the existing work. In different types of dense graphs with an average degree of no less than 10, using efficient dynamic programming-based preprocessing with a time complexity of O(M) (M is the total number of edges), a large number of optimal pruned depth-first traversal trees can be found, which are then used to quickly obtain accurate min-cuts of more than 99.9% node pairs. The algorithm can be used as an effective alternative to existing algorithms, and due to the inherent randomness, it is easy to fine tune the balance between overhead and precision, such as increasing the number of preprocessing passes to improve accuracy. |
---|---|
AbstractList | As an important problem in graph theory, the minimum-cut (min-cut) problem has various applications in many related fields. Among many acceleration strategies, one commonly used strategy is preprocessing the original graph to facilitate the min-cut calculations. In this paper, an optimal pruned tree-based min-cut acceleration algorithm (PTMA) is proposed for the problem by exploiting the mapping between the cuts and pruned depth-first traversal trees, which has not yet been investigated in the existing work. In different types of dense graphs with an average degree of no less than 10, using efficient dynamic programming-based preprocessing with a time complexity of O(M) (M is the total number of edges), a large number of optimal pruned depth-first traversal trees can be found, which are then used to quickly obtain accurate min-cuts of more than 99.9% node pairs. The algorithm can be used as an effective alternative to existing algorithms, and due to the inherent randomness, it is easy to fine tune the balance between overhead and precision, such as increasing the number of preprocessing passes to improve accuracy. |
ArticleNumber | 119768 |
Author | Wei, Wei Liu, Yuting Zhang, Qinghui |
Author_xml | – sequence: 1 givenname: Wei surname: Wei fullname: Wei, Wei email: weiwei_ise@haut.edu.cn organization: Key Laboratory of Grain Information Processing and Control, Henan University of Technology, Ministry of Education, Zhengzhou 450001, China – sequence: 2 givenname: Yuting surname: Liu fullname: Liu, Yuting email: yuting@stu.haut.edu.cn organization: Key Laboratory of Grain Information Processing and Control, Henan University of Technology, Ministry of Education, Zhengzhou 450001, China – sequence: 3 givenname: Qinghui surname: Zhang fullname: Zhang, Qinghui email: zqh131@163.com organization: Key Laboratory of Grain Information Processing and Control, Henan University of Technology, Ministry of Education, Zhengzhou 450001, China |
BookMark | eNp9kEFLAzEQhYNUsK3-AG_5A7sm2U2ywVMpaoWKFz2HNJnVlG52SdKC_96UevY08Jg38963QLMwBkDonpKaEioe9rUPqWaENTWlSoruCs1pJ1klmKIzNCeEkYowzm_QIqU9IaSVQszR2yrgccp-MAc8xWMAh3M0J4ipCDkCVDuTitiblPHggx-OA7bHjNN4KFvYB-wgJMBf0Uzft-i6N4cEd39ziT6fnz7Wm2r7_vK6Xm0ry1qVK7ZrjGlY14MCp7hsVasEA9ta2RilRF_SkcaC49yBkp3bka6jDDglXDDZN0tEL3dtHFOK0OsplgrxR1Oizzz0Xhce-sxDX3gUz-PFAyXYyUPUyXoI5YuPYLN2o__H_Qt_dGo4 |
Cites_doi | 10.1145/263867.263872 10.1109/TCOMM.2019.2929757 10.1007/s10878-018-0352-0 10.1016/j.dam.2011.06.030 10.1109/LCOMM.2018.2830786 10.1109/TSG.2016.2565619 10.1109/LCOMM.2020.3028620 10.1016/j.adhoc.2017.01.006 10.1145/2628036 |
ContentType | Journal Article |
Copyright | 2023 Elsevier Inc. |
Copyright_xml | – notice: 2023 Elsevier Inc. |
DBID | AAYXX CITATION |
DOI | 10.1016/j.ins.2023.119768 |
DatabaseName | CrossRef |
DatabaseTitle | CrossRef |
DatabaseTitleList | |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Engineering Library & Information Science |
EISSN | 1872-6291 |
ExternalDocumentID | 10_1016_j_ins_2023_119768 S0020025523013531 |
GrantInformation_xml | – fundername: Henan University of Technology grantid: 2012012 funderid: https://doi.org/10.13039/501100003489 – fundername: National Natural Science Foundation of China grantid: 62073123; 62006071; 61973104 funderid: https://doi.org/10.13039/501100001809 – fundername: Zhengzhou Science and Technology Bureau grantid: 21ZZXTCX20 funderid: https://doi.org/10.13039/100010104 – fundername: Henan University of Technology grantid: 2020ZKCJ06 funderid: https://doi.org/10.13039/501100003489 – fundername: Ministry of Education grantid: KFJJ2022002 – fundername: Natural Science Foundation of Henan Province grantid: 232300421238 funderid: https://doi.org/10.13039/501100006407 – fundername: Key Laboratory of Grain Information Processing and Control (Henan University of Technology) – fundername: Henan University of Technology grantid: 21420080 funderid: https://doi.org/10.13039/501100003489 |
GroupedDBID | --K --M --Z -~X .DC .~1 0R~ 1B1 1OL 1RT 1~. 1~5 29I 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO AAYFN ABAOU ABBOA ABEFU ABFNM ABJNI ABMAC ABTAH ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADGUI ADJOM ADMUD ADTZH AEBSH AECPX AEKER AENEX AFFNX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX HLZ HVGLF HZ~ H~9 IHE J1W JJJVA KOM LG9 LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ SBC SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SST SSV SSW SSZ T5K TN5 TWZ UHS WH7 WUQ XPP YYP ZMT ZY4 ~02 ~G- AAXKI AAYXX ADVLN AFJKZ AKRWK CITATION |
ID | FETCH-LOGICAL-c249t-2b3aa328fe9ed957494962ec4c73a996f00403ced55de978db08812e5105627f3 |
IEDL.DBID | AIKHN |
ISSN | 0020-0255 |
IngestDate | Thu Sep 26 15:52:51 EDT 2024 Fri Feb 23 02:36:04 EST 2024 |
IsPeerReviewed | true |
IsScholarly | true |
Keywords | Graph preprocessing Minimum cut Optimal pruned tree Acceleration Tree-cut mapping |
Language | English |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-c249t-2b3aa328fe9ed957494962ec4c73a996f00403ced55de978db08812e5105627f3 |
ParticipantIDs | crossref_primary_10_1016_j_ins_2023_119768 elsevier_sciencedirect_doi_10_1016_j_ins_2023_119768 |
PublicationCentury | 2000 |
PublicationDate | January 2024 2024-01-00 |
PublicationDateYYYYMMDD | 2024-01-01 |
PublicationDate_xml | – month: 01 year: 2024 text: January 2024 |
PublicationDecade | 2020 |
PublicationTitle | Information sciences |
PublicationYear | 2024 |
Publisher | Elsevier Inc |
Publisher_xml | – name: Elsevier Inc |
References | Fang, Su, Chen, Sun, Lund (br0030) 2018; 9 Wei, Gong, Yang, Mu (br0210) 2020; 25 Ford, Fulkerson (br0230) 1962 Liers, Pardella (br0160) 2011; 159 Gawrychowski, Mozes, Weimann (br0120) 2019 Goldberg, Tarjan (br0010) 2014; 57 Zhang, Hua, Jiang, Zhang, Chen (br0170) 2011 Li, Panigrahi, Saranurak (br0080) 2022 Zhang, Li, Zhang, Li, Shen (br0040) 2019; 67 br0240 Li (br0110) 2021 Stoer, Wagner (br0250) 1997; 44 Zhao, Xu, Hua, Zhang (br0190) 2012 Scheuermann, Rosenhahn (br0150) 2011 Wei, Yang, Zhang (br0200) 2018; 22 Angel, Bampis, Kacem, Letsios (br0020) 2019; 37 Zhang (br0070) 2021 Saranurak (br0130) 2021 Dory, Efron, Mukhopadhyay, Nanongkai (br0140) 2021 Ghaffari, Zuzic (br0090) 2022 Li, Zhang, Zhang, Wang, Li (br0050) 2017; 59 Zhang, Xu, Hua, Zhao (br0180) 2012 Bondy, Murty (br0220) 2008 Abboud, Krauthgamer, Trabelsi (br0060) 2020 Li, Panigrahi (br0100) 2020 Abboud (10.1016/j.ins.2023.119768_br0060) 2020 Gawrychowski (10.1016/j.ins.2023.119768_br0120) Angel (10.1016/j.ins.2023.119768_br0020) 2019; 37 Zhang (10.1016/j.ins.2023.119768_br0070) Zhang (10.1016/j.ins.2023.119768_br0040) 2019; 67 Dory (10.1016/j.ins.2023.119768_br0140) 2021 Goldberg (10.1016/j.ins.2023.119768_br0010) 2014; 57 Scheuermann (10.1016/j.ins.2023.119768_br0150) 2011 Li (10.1016/j.ins.2023.119768_br0080) 2022 Liers (10.1016/j.ins.2023.119768_br0160) 2011; 159 Zhang (10.1016/j.ins.2023.119768_br0180) 2012 Zhang (10.1016/j.ins.2023.119768_br0170) 2011 Wei (10.1016/j.ins.2023.119768_br0210) 2020; 25 Stoer (10.1016/j.ins.2023.119768_br0250) 1997; 44 Fang (10.1016/j.ins.2023.119768_br0030) 2018; 9 Li (10.1016/j.ins.2023.119768_br0110) 2021 Li (10.1016/j.ins.2023.119768_br0100) 2020 Saranurak (10.1016/j.ins.2023.119768_br0130) 2021 Zhao (10.1016/j.ins.2023.119768_br0190) 2012 Bondy (10.1016/j.ins.2023.119768_br0220) 2008 Li (10.1016/j.ins.2023.119768_br0050) 2017; 59 Wei (10.1016/j.ins.2023.119768_br0200) 2018; 22 Ford (10.1016/j.ins.2023.119768_br0230) 1962 Ghaffari (10.1016/j.ins.2023.119768_br0090) |
References_xml | – start-page: 651 year: 2012 end-page: 656 ident: br0180 article-title: Contracting community for computing maximum flow publication-title: Proceedings of International Conference on Granular Computing contributor: fullname: Zhao – start-page: 105 year: 2020 end-page: 118 ident: br0060 article-title: Cut-equivalent trees are optimal for min-cut queries publication-title: Proceedings of IEEE Annual Symposium on Foundations of Computer Science contributor: fullname: Trabelsi – volume: 37 start-page: 1266 year: 2019 end-page: 1282 ident: br0020 article-title: Speed scaling on parallel processors with migration publication-title: J. Comb. Optim. contributor: fullname: Letsios – start-page: 1 year: 2012 end-page: 6 ident: br0190 article-title: Contraction network for solving maximum flow problem publication-title: Proceedings of the ACM SIGKDD Workshop on Mining Data Semantics contributor: fullname: Zhang – start-page: 80 year: 2021 end-page: 85 ident: br0130 article-title: A simple deterministic algorithm for edge connectivity publication-title: Proceedings of Symposium on Simplicity in Algorithms contributor: fullname: Saranurak – year: 2021 ident: br0070 article-title: Faster cut-equivalent trees in simple graphs contributor: fullname: Zhang – volume: 44 start-page: 585 year: 1997 end-page: 591 ident: br0250 article-title: A simple min-cut algorithm publication-title: J. ACM contributor: fullname: Wagner – volume: 57 start-page: 82 year: 2014 end-page: 89 ident: br0010 article-title: Efficient maximum flow algorithms publication-title: Commun. ACM contributor: fullname: Tarjan – start-page: 1144 year: 2021 end-page: 1153 ident: br0140 article-title: Distributed weighted min-cut in nearly-optimal time publication-title: Proceedings of the Annual ACM SIGACT Symposium on Theory of Computing contributor: fullname: Nanongkai – start-page: 1124 year: 2022 end-page: 1134 ident: br0080 article-title: A nearly optimal all-pairs min-cuts algorithm in simple graphs publication-title: Proceedings of IEEE Annual Symposium on Foundations of Computer Science contributor: fullname: Saranurak – year: 2019 ident: br0120 article-title: Minimum cut in contributor: fullname: Weimann – start-page: 384 year: 2021 end-page: 395 ident: br0110 article-title: Deterministic mincut in almost-linear time publication-title: Proceedings of the ACM SIGACT Symposium on Theory of Computing contributor: fullname: Li – volume: 25 start-page: 455 year: 2020 end-page: 459 ident: br0210 article-title: Minimum cut acceleration by exploiting tree-cut injection for upper bound estimation publication-title: IEEE Commun. Lett. contributor: fullname: Mu – start-page: 482 year: 2011 end-page: 486 ident: br0170 article-title: Research on the maximum flow in large-scale network publication-title: Proceedings of International Conference on Computational Intelligence and Security contributor: fullname: Chen – start-page: 219 year: 2011 end-page: 232 ident: br0150 article-title: Slimcuts: graphcuts for high resolution images using graph reduction publication-title: Proceedings of International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition contributor: fullname: Rosenhahn – volume: 159 start-page: 2187 year: 2011 end-page: 2203 ident: br0160 article-title: Simplifying maximum flow computations: the effect of shrinking and good initial flows publication-title: Discrete Appl. Math. contributor: fullname: Pardella – year: 2022 ident: br0090 article-title: Universally-optimal distributed exact min-cut contributor: fullname: Zuzic – year: 2008 ident: br0220 article-title: Graph Theory contributor: fullname: Murty – volume: 67 start-page: 6912 year: 2019 end-page: 6924 ident: br0040 article-title: STAG-based QoS support routing strategy for multiple missions over the satellite networks publication-title: IEEE Trans. Commun. contributor: fullname: Shen – volume: 59 start-page: 63 year: 2017 end-page: 70 ident: br0050 article-title: A maximum flow algorithm based on storage time aggregated graph for delay-tolerant networks publication-title: Ad Hoc Netw. contributor: fullname: Li – volume: 22 start-page: 1330 year: 2018 end-page: 1333 ident: br0200 article-title: SPLMax: exploiting the simple path introduced locality for maximum flow acceleration publication-title: IEEE Commun. Lett. contributor: fullname: Zhang – volume: 9 start-page: 777 year: 2018 end-page: 785 ident: br0030 article-title: Power system structural vulnerability assessment based on an improved maximum flow approach publication-title: IEEE Trans. Smart Grid contributor: fullname: Lund – start-page: 85 year: 2020 end-page: 92 ident: br0100 article-title: Deterministic min-cut in poly-logarithmic max-flows publication-title: Proceedings of IEEE Annual Symposium on Foundations of Computer Science contributor: fullname: Panigrahi – ident: br0240 – year: 1962 ident: br0230 article-title: Flows in Networks contributor: fullname: Fulkerson – ident: 10.1016/j.ins.2023.119768_br0070 contributor: fullname: Zhang – start-page: 1 year: 2012 ident: 10.1016/j.ins.2023.119768_br0190 article-title: Contraction network for solving maximum flow problem contributor: fullname: Zhao – volume: 44 start-page: 585 issue: 4 year: 1997 ident: 10.1016/j.ins.2023.119768_br0250 article-title: A simple min-cut algorithm publication-title: J. ACM doi: 10.1145/263867.263872 contributor: fullname: Stoer – ident: 10.1016/j.ins.2023.119768_br0090 contributor: fullname: Ghaffari – start-page: 1144 year: 2021 ident: 10.1016/j.ins.2023.119768_br0140 article-title: Distributed weighted min-cut in nearly-optimal time contributor: fullname: Dory – volume: 67 start-page: 6912 issue: 10 year: 2019 ident: 10.1016/j.ins.2023.119768_br0040 article-title: STAG-based QoS support routing strategy for multiple missions over the satellite networks publication-title: IEEE Trans. Commun. doi: 10.1109/TCOMM.2019.2929757 contributor: fullname: Zhang – ident: 10.1016/j.ins.2023.119768_br0120 contributor: fullname: Gawrychowski – volume: 37 start-page: 1266 issue: 4 year: 2019 ident: 10.1016/j.ins.2023.119768_br0020 article-title: Speed scaling on parallel processors with migration publication-title: J. Comb. Optim. doi: 10.1007/s10878-018-0352-0 contributor: fullname: Angel – volume: 159 start-page: 2187 issue: 17 year: 2011 ident: 10.1016/j.ins.2023.119768_br0160 article-title: Simplifying maximum flow computations: the effect of shrinking and good initial flows publication-title: Discrete Appl. Math. doi: 10.1016/j.dam.2011.06.030 contributor: fullname: Liers – start-page: 1124 year: 2022 ident: 10.1016/j.ins.2023.119768_br0080 article-title: A nearly optimal all-pairs min-cuts algorithm in simple graphs contributor: fullname: Li – start-page: 80 year: 2021 ident: 10.1016/j.ins.2023.119768_br0130 article-title: A simple deterministic algorithm for edge connectivity contributor: fullname: Saranurak – volume: 22 start-page: 1330 issue: 7 year: 2018 ident: 10.1016/j.ins.2023.119768_br0200 article-title: SPLMax: exploiting the simple path introduced locality for maximum flow acceleration publication-title: IEEE Commun. Lett. doi: 10.1109/LCOMM.2018.2830786 contributor: fullname: Wei – start-page: 651 year: 2012 ident: 10.1016/j.ins.2023.119768_br0180 article-title: Contracting community for computing maximum flow contributor: fullname: Zhang – start-page: 482 year: 2011 ident: 10.1016/j.ins.2023.119768_br0170 article-title: Research on the maximum flow in large-scale network contributor: fullname: Zhang – volume: 9 start-page: 777 issue: 2 year: 2018 ident: 10.1016/j.ins.2023.119768_br0030 article-title: Power system structural vulnerability assessment based on an improved maximum flow approach publication-title: IEEE Trans. Smart Grid doi: 10.1109/TSG.2016.2565619 contributor: fullname: Fang – start-page: 384 year: 2021 ident: 10.1016/j.ins.2023.119768_br0110 article-title: Deterministic mincut in almost-linear time contributor: fullname: Li – start-page: 219 year: 2011 ident: 10.1016/j.ins.2023.119768_br0150 article-title: Slimcuts: graphcuts for high resolution images using graph reduction contributor: fullname: Scheuermann – year: 2008 ident: 10.1016/j.ins.2023.119768_br0220 contributor: fullname: Bondy – volume: 25 start-page: 455 issue: 2 year: 2020 ident: 10.1016/j.ins.2023.119768_br0210 article-title: Minimum cut acceleration by exploiting tree-cut injection for upper bound estimation publication-title: IEEE Commun. Lett. doi: 10.1109/LCOMM.2020.3028620 contributor: fullname: Wei – start-page: 85 year: 2020 ident: 10.1016/j.ins.2023.119768_br0100 article-title: Deterministic min-cut in poly-logarithmic max-flows contributor: fullname: Li – year: 1962 ident: 10.1016/j.ins.2023.119768_br0230 contributor: fullname: Ford – volume: 59 start-page: 63 issue: 5 year: 2017 ident: 10.1016/j.ins.2023.119768_br0050 article-title: A maximum flow algorithm based on storage time aggregated graph for delay-tolerant networks publication-title: Ad Hoc Netw. doi: 10.1016/j.adhoc.2017.01.006 contributor: fullname: Li – start-page: 105 year: 2020 ident: 10.1016/j.ins.2023.119768_br0060 article-title: Cut-equivalent trees are optimal for min-cut queries contributor: fullname: Abboud – volume: 57 start-page: 82 issue: 8 year: 2014 ident: 10.1016/j.ins.2023.119768_br0010 article-title: Efficient maximum flow algorithms publication-title: Commun. ACM doi: 10.1145/2628036 contributor: fullname: Goldberg |
SSID | ssj0004766 |
Score | 2.4764829 |
Snippet | As an important problem in graph theory, the minimum-cut (min-cut) problem has various applications in many related fields. Among many acceleration strategies,... |
SourceID | crossref elsevier |
SourceType | Aggregation Database Publisher |
StartPage | 119768 |
SubjectTerms | Acceleration Graph preprocessing Minimum cut Optimal pruned tree Tree-cut mapping |
Title | An optimal pruned traversal tree-based fast minimum cut solver in dense graph |
URI | https://dx.doi.org/10.1016/j.ins.2023.119768 |
Volume | 652 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3PS8MwFH7M7aIH0ak4dSMH8SB0o0na2uMYjqlsJwe7lbRJocK6sbVX_3bfa1OcoBePDX1t-ZJ8772-HwG4Jx3pSpey-33tSCVCJzRe4ChXoD7141QJqneeL_zZUr6uvFULJk0tDKVVWu6vOb1iazsysmiOtllGNb68sojRiKbDG9AF6qA6krINnfHL22zxXR4Z1CFL8pRIoAluVmleWU5Nu7kYUjyNGq7-pp4OVM70DE6trcjG9eecQ8vkXTg56CDYhb6tO2APzBYWEdDM7tgLmI9ztkFWWONztrsSOZUVdODQbo8DFJB2SI1plqp9wajNyLpcs6QsGC5JvItlOUNi2htWNba-hOX0-X0yc-wJCk6CblXh8FgoJfhTakKjQy-gVjQ-N4lMAqHQ00lpDwuE2vO0QX9Sx0g6Ljdkdfk8SMUVtPNNbq6BpYmIXQq6KZ3KJNY4i4FODMcX4bAMevDYABdt60YZUZNB9hEhyhGhHNUo90A20EY_ZjtCIv9b7OZ_YrdwjFey_nFyB-1iV5o-mhJFPICj4ac7sAvmC6J0xws |
link.rule.ids | 315,786,790,4521,24144,27955,27956,45618,45712 |
linkProvider | Elsevier |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3PT8IwFH4heFAPRlEjKtqD8WAyyNpuc0dCJKjACRJuTbd1CSYMAtvVv933ti5iohevXbstX9vvvdf3owAPJCNd6VJ0v584UovQCY0XONoVKE_9KNWC8p0nU380l28Lb9GAQZ0LQ2GVlvsrTi_Z2rb0LJq9zXJJOb681IhRiabLG9AEOiBtgOK6up_fcR4yqByWZCdR99q1WQZ5LTMq2c1Fl7xpVG71N-G0J3CGp3BiNUXWr37mDBoma8HxXv3AFnRs1gF7ZDatiGBmdr-ew6SfsTVywgrfs9kWyKgsp-uGtjtsIHe0Q0IsYane5YyKjKyKFYuLnOGCxF5smTGkpZ1hZVnrC5gPX2aDkWPvT3BiNKpyh0dCa8GfUxOaJPQCKkTjcxPLOBAa7ZyUdrBAoD0vMWhNJhFSjssN6Vw-D1JxCc1snZkrYGksIpdcbjpJZRwlOIdBEhuOH8JmGbThqQZObaoyGaqOH_tQiLIilFWFchtkDa36MdcKafzvYdf_G3YPh6PZZKzGr9P3GzjCJ7I6QrmFZr4tTAeVijy6KxfNF2GVx-A |
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=An+optimal+pruned+traversal+tree-based+fast+minimum+cut+solver+in+dense+graph&rft.jtitle=Information+sciences&rft.au=Wei%2C+Wei&rft.au=Liu%2C+Yuting&rft.au=Zhang%2C+Qinghui&rft.date=2024-01-01&rft.issn=0020-0255&rft.volume=652&rft.spage=119768&rft_id=info:doi/10.1016%2Fj.ins.2023.119768&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_ins_2023_119768 |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-0255&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-0255&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-0255&client=summon |