{"id":"https://openalex.org/W4416613442","doi":"https://doi.org/10.1016/j.procs.2025.10.282","title":"A Weight Function Lemma Heuristic for Graph Pebbling","display_name":"A Weight Function Lemma Heuristic for Graph Pebbling","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4416613442","doi":"https://doi.org/10.1016/j.procs.2025.10.282"},"language":"en","primary_location":{"id":"doi:10.1016/j.procs.2025.10.282","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2025.10.282","pdf_url":null,"source":{"id":"https://openalex.org/S120348307","display_name":"Procedia Computer Science","issn_l":"1877-0509","issn":["1877-0509"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Procedia Computer Science","raw_type":"journal-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/j.procs.2025.10.282","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5093774891","display_name":"Guilherme Adamatti Bridi","orcid":"https://orcid.org/0009-0000-8226-8286"},"institutions":[{"id":"https://openalex.org/I122140584","display_name":"Universidade Federal do Rio de Janeiro","ror":"https://ror.org/03490as77","country_code":"BR","type":"education","lineage":["https://openalex.org/I122140584"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Guilherme Adamatti Bridi","raw_affiliation_strings":["Federal University of Rio de Janeiro, Rio de Janeiro, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Federal University of Rio de Janeiro, Rio de Janeiro, Brazil","institution_ids":["https://openalex.org/I122140584"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066767589","display_name":"Franklin de Lima Marquezino","orcid":"https://orcid.org/0000-0001-9712-1930"},"institutions":[{"id":"https://openalex.org/I122140584","display_name":"Universidade Federal do Rio de Janeiro","ror":"https://ror.org/03490as77","country_code":"BR","type":"education","lineage":["https://openalex.org/I122140584"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Franklin de Lima Marquezino","raw_affiliation_strings":["Federal University of Rio de Janeiro, Rio de Janeiro, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Federal University of Rio de Janeiro, Rio de Janeiro, Brazil","institution_ids":["https://openalex.org/I122140584"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032868379","display_name":"Celina M.H. de Figueiredo","orcid":"https://orcid.org/0000-0002-6393-0876"},"institutions":[{"id":"https://openalex.org/I122140584","display_name":"Universidade Federal do Rio de Janeiro","ror":"https://ror.org/03490as77","country_code":"BR","type":"education","lineage":["https://openalex.org/I122140584"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Celina Miraglia Herrera de Figueiredo","raw_affiliation_strings":["Federal University of Rio de Janeiro, Rio de Janeiro, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Federal University of Rio de Janeiro, Rio de Janeiro, Brazil","institution_ids":["https://openalex.org/I122140584"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5032868379","https://openalex.org/A5066767589","https://openalex.org/A5093774891"],"corresponding_institution_ids":["https://openalex.org/I122140584"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.44222904,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"273","issue":null,"first_page":"70","last_page":"77"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.710099995136261,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.710099995136261,"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.12049999833106995,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.05950000137090683,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.6273000240325928},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.571399986743927},{"id":"https://openalex.org/keywords/weight-function","display_name":"Weight function","score":0.5467000007629395},{"id":"https://openalex.org/keywords/lemma","display_name":"Lemma (botany)","score":0.5206999778747559},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.492000013589859},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4853000044822693},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.4772000014781952},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.46700000762939453},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.45669999718666077}],"concepts":[{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.6273000240325928},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.571399986743927},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.553600013256073},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5486999750137329},{"id":"https://openalex.org/C134466208","wikidata":"https://www.wikidata.org/wiki/Q1520657","display_name":"Weight function","level":2,"score":0.5467000007629395},{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.5206999778747559},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.492000013589859},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4853000044822693},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.4772000014781952},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.46700000762939453},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.45669999718666077},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4553000032901764},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41290000081062317},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.38499999046325684},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3822000026702881},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.3578000068664551},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.3479999899864197},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.3434999883174896},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3212999999523163},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.30480000376701355},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2953000068664551},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.27459999918937683},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.26579999923706055},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.26429998874664307},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.25220000743865967},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.25049999356269836}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.procs.2025.10.282","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2025.10.282","pdf_url":null,"source":{"id":"https://openalex.org/S120348307","display_name":"Procedia Computer Science","issn_l":"1877-0509","issn":["1877-0509"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Procedia Computer Science","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/j.procs.2025.10.282","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2025.10.282","pdf_url":null,"source":{"id":"https://openalex.org/S120348307","display_name":"Procedia Computer Science","issn_l":"1877-0509","issn":["1877-0509"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Procedia Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2873419578","display_name":null,"funder_award_id":"88887.950125/2024-00","funder_id":"https://openalex.org/F4320321091","funder_display_name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior"},{"id":"https://openalex.org/G5630618752","display_name":null,"funder_award_id":"E-26/204.143/2024","funder_id":"https://openalex.org/F4320322749","funder_display_name":"Funda\u00e7\u00e3o Carlos Chagas Filho de Amparo \u00e0 Pesquisa do Estado do Rio de Janeiro"},{"id":"https://openalex.org/G8907916564","display_name":null,"funder_award_id":"407296/2021-2","funder_id":"https://openalex.org/F4320316670","funder_display_name":"Universal"}],"funders":[{"id":"https://openalex.org/F4320316670","display_name":"Universal","ror":null},{"id":"https://openalex.org/F4320321091","display_name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","ror":"https://ror.org/00x0ma614"},{"id":"https://openalex.org/F4320322025","display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","ror":"https://ror.org/03swz6y49"},{"id":"https://openalex.org/F4320322749","display_name":"Funda\u00e7\u00e3o Carlos Chagas Filho de Amparo \u00e0 Pesquisa do Estado do Rio de Janeiro","ror":"https://ror.org/03kk0s825"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W2015837397","https://openalex.org/W2033611584","https://openalex.org/W2042779161","https://openalex.org/W2048800026","https://openalex.org/W2338527282","https://openalex.org/W2462494491","https://openalex.org/W3214075858","https://openalex.org/W4241527888","https://openalex.org/W4391018647","https://openalex.org/W4404174377"],"related_works":[],"abstract_inverted_index":{"Graph":[0],"pebbling":[1,60,64],"is":[2,39,86,106,184],"a":[3,14,20,28,162,171,287],"problem":[4],"in":[5,69,197,216,261],"which":[6,92,115,198],"pebbles":[7,24,46],"are":[8,25],"distributed":[9,143],"across":[10],"the":[11,42,59,63,70,79,87,109,113,124,137,139,149,177,191,194,204,213,217,221,227,235,245,249,253,262,265,279,284],"vertices":[12,219],"of":[13,45,78,112,126,179,190,193,286],"graph":[15],"and":[16,258,274],"moved":[17],"according":[18],"to":[19,30,40,48,74,107,118,244,256,271],"specific":[21],"rule:":[22],"two":[23],"removed":[26],"from":[27,220,252],"vertex":[29,53],"place":[31],"one":[32],"on":[33,94,203],"an":[34,103],"adjacent":[35],"vertex.":[36],"The":[37,182],"goal":[38],"determine":[41],"minimum":[43],"number":[44,65],"required":[47],"ensure":[49],"that":[50,175,212],"any":[51],"target":[52],"can":[54],"be":[55,119,142],"reached,":[56],"known":[57],"as":[58,144,146],"number.":[61],"Computing":[62],"lies":[66,215],"beyond":[67,234],"NP":[68],"polynomial":[71],"hierarchy,":[72],"leading":[73],"bounding":[75],"methods.":[76],"One":[77],"most":[80],"prominent":[81],"techniques":[82],"for":[83,264],"upper":[84,281],"bounds":[85,202,206],"Weight":[88],"Function":[89],"Lemma":[90],"(WFL),":[91],"relies":[93],"costly":[95],"integer":[96],"linear":[97],"optimization.":[98],"To":[99,135,165,230],"mitigate":[100],"this":[101,159,167],"cost,":[102],"alternative":[104],"approach":[105,160],"consider":[108],"dual":[110,195],"formulation":[111],"problem,":[114],"allows":[116],"solutions":[117],"constructed":[120],"by":[121,129,186],"hand":[122],"through":[123],"selection":[125,178,290],"strategies":[127],"given":[128],"subtrees":[130,250],"with":[131],"associated":[132],"weight":[133,225,233,242],"functions.":[134],"improve":[136,278],"bounds,":[138,282],"weights":[140,263],"should":[141],"uniformly":[145],"possible":[147],"among":[148],"vertices,":[150,247],"balancing":[151],"their":[152],"individual":[153],"contribution.":[154],"However,":[155],"despite":[156],"its":[157],"simplicity,":[158],"lacks":[161],"formal":[163],"framework.":[164],"fill":[166],"gap,":[168],"we":[169,199,277],"introduce":[170],"novel":[172],"heuristic":[173,240,270],"method":[174,183],"refines":[176],"balanced":[180],"strategies.":[181],"motivated":[185],"our":[187,238,269],"theoretical":[188,209,236],"analysis":[189,210],"limitations":[192],"approach,":[196],"prove":[200],"lower":[201],"best":[205],"achievable.":[207],"Our":[208],"shows":[211],"bottleneck":[214],"farthest":[218,246],"target,":[222],"forcing":[223],"surplus":[224,232],"onto":[226],"closer":[228],"neighborhoods.":[229],"minimize":[231],"minimum,":[237],"proposed":[239],"prioritizes":[241],"assignment":[243],"building":[248],"starting":[251],"shortest":[254],"paths":[255],"them":[257],"then":[259],"filling":[260],"remaining":[266],"vertices.":[267],"Applying":[268],"Flower":[272],"snarks":[273],"Blanu\u0161a":[275],"snarks,":[276],"best-known":[280],"demonstrating":[283],"effectiveness":[285],"structured":[288],"strategy":[289],"when":[291],"using":[292],"WFL.":[293]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-11-25T00:00:00"}