{"id":"https://openalex.org/W7165147811","doi":"https://doi.org/10.1145/3770854.3780204","title":"Minimizing Total Biharmonic Distance in Large Graphs via Link Recommendation","display_name":"Minimizing Total Biharmonic Distance in Large Graphs via Link Recommendation","publication_year":2026,"publication_date":"2026-06-16","ids":{"openalex":"https://openalex.org/W7165147811","doi":"https://doi.org/10.1145/3770854.3780204"},"language":null,"primary_location":{"id":"pmh:oai:arXiv.org:2606.17703","is_oa":true,"landing_page_url":"https://arxiv.org/abs/2606.17703","pdf_url":"https://arxiv.org/pdf/2606.17703","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"type":"article","indexed_in":["arxiv"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2606.17703","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5113903386","display_name":"X J Zhou","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhou, Xinna","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5138940718","display_name":"Zhongzhi Zhang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhang, Zhongzhi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.93427678,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.5564000010490417,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.5564000010490417,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.1826999932527542,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.056699998676776886,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/biharmonic-equation","display_name":"Biharmonic equation","score":0.8781999945640564},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5253999829292297},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.4693000018596649},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.45590001344680786},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.45239999890327454},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.4415000081062317},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4311999976634979},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.40619999170303345},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.4018999934196472}],"concepts":[{"id":"https://openalex.org/C145784156","wikidata":"https://www.wikidata.org/wiki/Q859808","display_name":"Biharmonic equation","level":3,"score":0.8781999945640564},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5812000036239624},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5253999829292297},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.4693000018596649},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45590001344680786},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.45239999890327454},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.4415000081062317},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4311999976634979},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.40619999170303345},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.40529999136924744},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4018999934196472},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.38940000534057617},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.384799987077713},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.3846000134944916},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36980000138282776},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36899998784065247},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3671000003814697},{"id":"https://openalex.org/C165700671","wikidata":"https://www.wikidata.org/wiki/Q203484","display_name":"Laplace operator","level":2,"score":0.3424000144004822},{"id":"https://openalex.org/C115178988","wikidata":"https://www.wikidata.org/wiki/Q772067","display_name":"Laplacian matrix","level":3,"score":0.3312000036239624},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32760000228881836},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3174999952316284},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.3165000081062317},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.3084000051021576},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3046000003814697},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2969000041484833},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.29679998755455017},{"id":"https://openalex.org/C2778753846","wikidata":"https://www.wikidata.org/wiki/Q6554239","display_name":"Link (geometry)","level":2,"score":0.2879999876022339},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.2644999921321869}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:arXiv.org:2606.17703","is_oa":true,"landing_page_url":"https://arxiv.org/abs/2606.17703","pdf_url":"https://arxiv.org/pdf/2606.17703","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2606.17703","is_oa":true,"landing_page_url":"https://arxiv.org/abs/2606.17703","pdf_url":"https://arxiv.org/pdf/2606.17703","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G537946182","display_name":null,"funder_award_id":"61872093","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G55803007","display_name":null,"funder_award_id":"62372112","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7165147811.pdf","grobid_xml":"https://content.openalex.org/works/W7165147811.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,56],"total":[1,40],"biharmonic":[2,10,41],"distance,":[3],"which":[4],"is":[5,20,58,70],"the":[6,9,35,39,64,68,90,103,106,116,140],"sum":[7],"of":[8,15,37,67,94,119,144],"distance":[11,42],"between":[12],"every":[13],"pair":[14],"nodes":[16],"in":[17],"a":[18,21,49],"network,":[19],"key":[22],"metric":[23],"for":[24,48],"evaluating":[25],"network":[26],"connectivity":[27],"and":[28,53,109,142],"robustness.":[29],"In":[30],"this":[31,77],"paper,":[32],"we":[33,79,98],"study":[34],"problem":[36,57,69],"minimizing":[38],"by":[43],"adding":[44],"$k$":[45],"nonexistent":[46],"edges":[47],"given":[50],"graph":[51],"$G$":[52],"budget":[54],"$k$.":[55],"computationally":[59],"challenging.":[60],"We":[61],"show":[62],"that":[63],"objective":[65],"function":[66],"monotone":[71],"but":[72],"not":[73],"supermodular.":[74],"To":[75,88],"solve":[76],"problem,":[78],"propose":[80],"simple":[81],"greedy":[82,96],"algorithms":[83,122],"with":[84],"cubic":[85,124],"time":[86,92,117],"complexity.":[87],"mitigate":[89],"high":[91],"complexity":[93,118],"these":[95],"algorithms,":[97],"apply":[99],"several":[100],"techniques,":[101],"including":[102],"projection":[104],"method,":[105],"Laplacian":[107],"solver,":[108],"convex":[110],"hull":[111],"approximation.":[112],"These":[113],"techniques":[114],"reduce":[115],"our":[120,145],"proposed":[121,146],"from":[123],"to":[125],"nearly":[126],"linear":[127],"while":[128],"providing":[129],"error":[130],"guarantees.":[131],"Finally,":[132],"extensive":[133],"experiments":[134],"on":[135],"real":[136],"datasets":[137],"demonstrate":[138],"both":[139],"efficiency":[141],"effectiveness":[143],"algorithms.":[147]},"counts_by_year":[],"updated_date":"2026-06-20T20:08:15.867695","created_date":"2026-06-19T00:00:00"}