Algorithms for 2-balanced connected k-partition problem in graphs

Motivated by the result of balanced connected graph edge partition problem for trees, we investigate the 2-balanced connected graph vertex k -partition problem. This paper leverages the charity vertex method and proposes several algorithms for 2-balanced vertex-connected partitioning. Furthermore, w...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of combinatorial optimization Ročník 50; číslo 1; s. 4
Hlavní autoři:	Yu, Junran, Hu, Jing, Gao, Jiaquan, Du, Donglei, Zhang, Xiaoyan
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.08.2025 Springer Nature B.V
Témata:	Algorithms Approximation Codes Combinatorics Convex and Discrete Geometry Graphs Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Polynomials Theory of Computation Trees (mathematics) Charity vertex Balanced connected partition Graph vertex partition algorithm
ISSN:	1382-6905, 1573-2886
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	Motivated by the result of balanced connected graph edge partition problem for trees, we investigate the 2-balanced connected graph vertex k -partition problem. This paper leverages the charity vertex method and proposes several algorithms for 2-balanced vertex-connected partitioning. Furthermore, we prove that these algorithms are polynomial-time solvable on degree-bounded graphs, thereby refining and extending the results of Caragiannis et al.
AbstractList	Motivated by the result of balanced connected graph edge partition problem for trees, we investigate the 2-balanced connected graph vertex k -partition problem. This paper leverages the charity vertex method and proposes several algorithms for 2-balanced vertex-connected partitioning. Furthermore, we prove that these algorithms are polynomial-time solvable on degree-bounded graphs, thereby refining and extending the results of Caragiannis et al. Motivated by the result of balanced connected graph edge partition problem for trees, we investigate the 2-balanced connected graph vertex k-partition problem. This paper leverages the charity vertex method and proposes several algorithms for 2-balanced vertex-connected partitioning. Furthermore, we prove that these algorithms are polynomial-time solvable on degree-bounded graphs, thereby refining and extending the results of Caragiannis et al.
ArticleNumber	4
Author	Hu, Jing Yu, Junran Gao, Jiaquan Du, Donglei Zhang, Xiaoyan
Author_xml	– sequence: 1 givenname: Junran surname: Yu fullname: Yu, Junran organization: School of Mathematical Science, Institute of Mathematics, and Ministry of Education Key Laboratory of NSLSCS, Nanjing Normal University – sequence: 2 givenname: Jing surname: Hu fullname: Hu, Jing organization: School of Mathematical Science, Institute of Mathematics, and Ministry of Education Key Laboratory of NSLSCS, Nanjing Normal University – sequence: 3 givenname: Jiaquan surname: Gao fullname: Gao, Jiaquan organization: School of Computer Science, Institute of Mathematics, and Ministry of Education Key Laboratory of NSLSCS, Nanjing Normal University – sequence: 4 givenname: Donglei surname: Du fullname: Du, Donglei organization: Faculty of Management, University of New Brunswick – sequence: 5 givenname: Xiaoyan orcidid: 0000-0002-3085-2701 surname: Zhang fullname: Zhang, Xiaoyan email: royxyzhang@gmail.com organization: School of Mathematical Science, Institute of Mathematics, and Ministry of Education Key Laboratory of NSLSCS, Nanjing Normal University
BookMark	eNp9kLtOwzAUhi1UJNrCCzBFYjYc23HijFXFTarEArNlO3aaktrBTgfeHkOQ2JjOP_yXo2-FFj54i9A1gVsCUN8lAqIWGCjHQBijGM7QkvCaYSpEtciaCYqrBvgFWqV0AICsyyXabIYuxH7aH1PhQiwo1mpQ3ti2MMF7a6as3vGo4tRPffDFGIMe7LHofdFFNe7TJTp3akj26veu0dvD_ev2Ce9eHp-3mx02tKYTZq4SebUERVxlWdm2hFvdlA5AOW2N1kJxDcAM5VVT16VpGyJKKK0VjmrF1uhm7s0ffJxsmuQhnKLPk5JRzisqas6zi84uE0NK0To5xv6o4qckIL9RyRmVzKjkDyoJOcTmUMpm39n4V_1P6gvbKG0i
Cites_doi	10.1016/0166-218X(93)90048-S 10.1016/0166-218X(83)90014-8 10.1016/S0020-0190(96)00175-5 10.1007/BF01896190 10.1016/0166-218X(85)90008-3 10.1007/978-1-84628-970-5 10.1137/20M1359134 10.1109/INFOTEH48170.2020.9066293 10.1016/j.eswa.2018.09.001 10.1145/3328526.3329574 10.1007/s00453-021-00870-3 10.1609/aaai.v36i5.20420 10.1016/j.dam.2010.05.014 10.1007/s10878-020-00544-w 10.1109/CLOUD.2010.24
ContentType	Journal Article
Copyright	The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025 Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law. The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025.
Copyright_xml	– notice: The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025 Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law. – notice: The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025.
DBID	AAYXX CITATION
DOI	10.1007/s10878-025-01332-0
DatabaseName	CrossRef
DatabaseTitle	CrossRef
DatabaseTitleList
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Mathematics
EISSN	1573-2886
ExternalDocumentID	10_1007_s10878_025_01332_0
GrantInformation_xml	– fundername: National Natural Science Foundation of China grantid: 12271259; 61872422 funderid: http://dx.doi.org/10.13039/501100001809
GroupedDBID	-~C .86 .DC .VR 06D 0R~ 0VY 1N0 203 29K 2J2 2JN 2JY 2KG 2KM 2LR 2~H 30V 4.4 406 408 409 40D 40E 5GY 5VS 67Z 6NX 8TC 8UJ 95- 95. 95~ 96X AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAPKM AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBRH ABBXA ABDBE ABDZT ABECU ABFSG ABFTD ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABRTQ ABSXP ABTEG ABTHY ABTKH ABTMW ABWNU ABXPI ACAOD ACDTI ACGFS ACHSB ACHXU ACIWK ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACSTC ACZOJ ADHHG ADHIR ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEFQL AEGAL AEGNC AEJHL AEJRE AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AEZWR AFBBN AFDZB AFHIU AFLOW AFOHR AFQWF AFWTZ AFZKB AGAYW AGDGC AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHPBZ AHWEU AHYZX AIAKS AIGIU AIIXL AILAN AITGF AIXLP AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARMRJ ASPBG ATHPR AVWKF AXYYD AYFIA AYJHY AZFZN B-. BA0 BAPOH BGNMA BSONS CS3 CSCUP D-I DDRTE DL5 DNIVK DPUIP DU5 EBLON EBS EIOEI ESBYG F5P FEDTE FERAY FFXSO FIGPU FNLPD FRRFC FWDCC GGCAI GGRSB GJIRD GNWQR GQ7 GQ8 GXS HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ I09 IHE IJ- IKXTQ IWAJR IXC IXD IXE IZIGR IZQ I~X I~Z J-C J0Z J9A JBSCW JCJTX JZLTJ KDC KOV LAK LLZTM M4Y MA- NB0 NPVJJ NQJWS NU0 O93 O9J OAM P2P P9R PF0 PT4 PT5 QOS R89 R9I RNS ROL RPX RSV S16 S1Z S27 S3B SAP SDH SHX SISQX SJYHP SMT SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 TSG TSK TSV TUC U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 ZMTXR -Y2 1SB 2P1 2VQ AARHV AAYXX ABJCF ABQSL ABULA ACBXY ADHKG AEBTG AEKMD AFFHD AFGCZ AFKRA AGGDS AGQPQ AHSBF AJBLW ARAPS AZQEC BDATZ BENPR BGLVJ CAG CCPQU CITATION COF DWQXO EJD FINBP FSGXE GNUQQ H13 HCIFZ M2P M7S N2Q O9- OVD PHGZM PHGZT PQGLB PTHSS RNI RZC RZE RZK TEORI
ID	FETCH-LOGICAL-c272t-3f6800040a1f6e34dd15eb94f00afbecbb8a5b003c2569774cd918404ee8f2ba3
IEDL.DBID	RSV
ISICitedReferencesCount	0
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001558965400005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1382-6905
IngestDate	Wed Oct 01 07:00:56 EDT 2025 Sat Nov 29 07:35:20 EST 2025 Tue Aug 26 01:11:04 EDT 2025
IsPeerReviewed	true
IsScholarly	true
Issue	1
Keywords	Charity vertex Balanced connected partition Graph vertex partition algorithm
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c272t-3f6800040a1f6e34dd15eb94f00afbecbb8a5b003c2569774cd918404ee8f2ba3
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0000-0002-3085-2701
PQID	3255628755
PQPubID	2043856
ParticipantIDs	proquest_journals_3255628755 crossref_primary_10_1007_s10878_025_01332_0 springer_journals_10_1007_s10878_025_01332_0
PublicationCentury	2000
PublicationDate	2025-08-01
PublicationDateYYYYMMDD	2025-08-01
PublicationDate_xml	– month: 08 year: 2025 text: 2025-08-01 day: 01
PublicationDecade	2020
PublicationPlace	New York
PublicationPlace_xml	– name: New York – name: Dordrecht
PublicationTitle	Journal of combinatorial optimization
PublicationTitleAbbrev	J Comb Optim
PublicationYear	2025
Publisher	Springer US Springer Nature B.V
Publisher_xml	– name: Springer US – name: Springer Nature B.V
References	L Lovász (1332_CR14) 1977; 30 F Chataigner (1332_CR10) 2007; 9 ME Dyer (1332_CR12) 1985; 10 BR Chaudhury (1332_CR8) 2021; 50 1332_CR4 J Chlebikova (1332_CR11) 1996; 60 1332_CR17 1332_CR3 1332_CR16 A Chu (1332_CR9) 2010; 158 1332_CR13 X Zhou (1332_CR18) 2019; 116 JA Bondy (1332_CR1) 2008 PM Camerini (1332_CR2) 1983; 5 G Chen (1332_CR6) 2022; 44 Y Chen (1332_CR7) 2021; 83 M Lucertini (1332_CR15) 1993; 42 F Chataigner (1332_CR5) 2007; 9
References_xml	– volume: 42 start-page: 227 issue: 2 year: 1993 ident: 1332_CR15 publication-title: Discret Appl Math doi: 10.1016/0166-218X(93)90048-S – volume: 9 start-page: 177 issue: 1 year: 2007 ident: 1332_CR10 publication-title: Discrete Mathematics and Theoretical Computer Science – volume: 5 start-page: 39 issue: 1 year: 1983 ident: 1332_CR2 publication-title: Discret Appl Math doi: 10.1016/0166-218X(83)90014-8 – volume: 60 start-page: 225 issue: 5 year: 1996 ident: 1332_CR11 publication-title: Inf Process Lett doi: 10.1016/S0020-0190(96)00175-5 – volume: 30 start-page: 241 issue: 3 year: 1977 ident: 1332_CR14 publication-title: Acta Math Hungar doi: 10.1007/BF01896190 – volume: 10 start-page: 139 issue: 2 year: 1985 ident: 1332_CR12 publication-title: Discret Appl Math doi: 10.1016/0166-218X(85)90008-3 – volume-title: Graph Theory year: 2008 ident: 1332_CR1 doi: 10.1007/978-1-84628-970-5 – volume: 50 start-page: 1336 issue: 4 year: 2021 ident: 1332_CR8 publication-title: SIAM J Comput doi: 10.1137/20M1359134 – ident: 1332_CR16 doi: 10.1109/INFOTEH48170.2020.9066293 – volume: 116 start-page: 10 year: 2019 ident: 1332_CR18 publication-title: Expert Syst Appl doi: 10.1016/j.eswa.2018.09.001 – ident: 1332_CR4 doi: 10.1145/3328526.3329574 – volume: 83 start-page: 3715 issue: 12 year: 2021 ident: 1332_CR7 publication-title: Algorithmica doi: 10.1007/s00453-021-00870-3 – ident: 1332_CR3 doi: 10.1609/aaai.v36i5.20420 – volume: 9 start-page: 177 issue: 1 year: 2007 ident: 1332_CR5 publication-title: Discrete Mathematics and Theoretical Computer Science – volume: 158 start-page: 1471 issue: 14 year: 2010 ident: 1332_CR9 publication-title: Discret Appl Math doi: 10.1016/j.dam.2010.05.014 – ident: 1332_CR13 – volume: 44 start-page: 1753 issue: 3 year: 2022 ident: 1332_CR6 publication-title: J Comb Optim doi: 10.1007/s10878-020-00544-w – ident: 1332_CR17 doi: 10.1109/CLOUD.2010.24
SSID	ssj0009054
Score	2.3752685
Snippet	Motivated by the result of balanced connected graph edge partition problem for trees, we investigate the 2-balanced connected graph vertex k -partition... Motivated by the result of balanced connected graph edge partition problem for trees, we investigate the 2-balanced connected graph vertex k-partition problem....
SourceID	proquest crossref springer
SourceType	Aggregation Database Index Database Publisher
StartPage	4
SubjectTerms	Algorithms Approximation Codes Combinatorics Convex and Discrete Geometry Graphs Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Polynomials Theory of Computation Trees (mathematics)
Title	Algorithms for 2-balanced connected k-partition problem in graphs
URI	https://link.springer.com/article/10.1007/s10878-025-01332-0 https://www.proquest.com/docview/3255628755
Volume	50
WOSCitedRecordID	wos001558965400005&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: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1573-2886 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0009054 issn: 1382-6905 databaseCode: RSV dateStart: 19970301 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV09T8MwED2hwgAD34hCQR7YwJLjxKkzVoiKASrEl7pFtuNARUmrJvD78aUJKQgGWCJFsazone17J9-9AziJtFSB0cydfklIAyM9qliUuoeSoU3DbqhLndmr7mAgh8PopioKy-ts9_pKsjypF4rdJKrBckw2831OXaC-7NydxIYNt3ePjdQuE_NWto47uthPVKUyP8_x1R01HPPbtWjpbfob__vPTViv2CXpzZfDFizZbBvWFjQH3dv1p1BrvgO93vhpMhsVz685cfSVcKox19HYhBhMgTGOkJIXOsUFhiYkVQMaMspIqXWd78JD_-L-_JJWXRWo4V1eUD8NJTI5prw0tH6QJJ6wOgpSxlTqLKqd9QRuduPYELJDk0QYBgbWypRr5e9BK5tkdh-Iby2Gk0ZwYZwz9JQ2XqS9SCiP6SBM2nBagxtP5-IZcSOTjDDFDqa4hClmbejU-MfVRspjHyXSXFQnRBvOarybz7_PdvC34YewykuTYWpfB1rF7M0ewYp5L0b57LhcYB__JMjw
linkProvider	Springer Nature
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3PS8MwFH7IFNSDv8Xp1By8aSBNm649DnFM3IbolN1CkqZzqN1Yq3-_SdfaKXrQS6E0hPK9l7zvkfe-AJyFMhCeksTsfpGPPRU4WJAwNg8R-Dr2m77MdWa7zX4_GA7D26IpLC2r3csjyXynXmh2C6waLLXFZq5LsUnUlz0Tsaxi_t39YyW1S9j8KlvDHU3ux4pWmZ_n-BqOKo757Vg0jzbtzf_95xZsFOwStebusA1LOtmB9QXNQfPW-xRqTXeh1XoZTWbj7Ok1RYa-IoqlrXVUOkLKlsAoQ0jRM55aB7MmRMUFNGicoFzrOt2Dh_bV4LKDi1sVsKJNmmE39gPL5IhwYl-7XhQ5TMvQiwkRsbGoNNZjdrErw4YsO1RRaNNAT-sgplK4-1BLJok-AORqbdNJxShTJhg6QionlE7IhEOk50d1OC_B5dO5eAavZJItTNzAxHOYOKlDo8SfFwsp5a6VSDNZHWN1uCjxrj7_Ptvh34afwmpn0Ovy7nX_5gjWaG4-W-bXgFo2e9PHsKLes3E6O8md7QN0UcvU
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3dS8MwEA-iIvrgtzidmgffNCxNm659HOpQnGPgB3sLTZroULuxVv9-c_2wU_RBfCmUllDurrnfj9z9DqHjUAaRpyS1u1_sE08FDoloaOwlCnxt_LYvc53ZXrvfD4bDcDDTxZ9Xu1dHkkVPA6g0JVlrEpvWTONbAMqwDArPXJcRS9oXPCikB75--1DL7lJejLW1ONLyQF62zfy8xtfUVOPNb0ekeebprv3_m9fRaok6cacIkw00p5NNtDKjRWjvbj4FXNMt1Om8PI6no-zpNcUW1mJGJNRAKh1jBaUxygJV_EwmEHjgWlwOpsGjBOca2Ok2uu9e3J1dknLaAlGszTLiGj8AhEcjx_ja9eLY4VqGnqE0MtbT0nqVwyagLEoC1KjiEOihp3VgmIzcHTSfjBO9i7CrNdBMxRlXNkk6kVROKJ2QRw6Vnh830EllaDEpRDVELZ8MZhLWTCI3k6AN1Kx8IcofLBUuSKdZtsd5A51Wtq8f_77a3t9eP0JLg_Ou6F31r_fRMsu9B9V_TTSfTd_0AVpU79konR7mcfcB3rTUuA
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=Algorithms+for+2-balanced+connected+k-partition+problem+in+graphs&rft.jtitle=Journal+of+combinatorial+optimization&rft.au=Yu%2C+Junran&rft.au=Hu%2C+Jing&rft.au=Gao%2C+Jiaquan&rft.au=Du%2C+Donglei&rft.date=2025-08-01&rft.issn=1382-6905&rft.eissn=1573-2886&rft.volume=50&rft.issue=1&rft_id=info:doi/10.1007%2Fs10878-025-01332-0&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s10878_025_01332_0
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1382-6905&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1382-6905&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1382-6905&client=summon