{"id":"https://openalex.org/W7204451891","doi":"https://doi.org/10.67313/slijms.2026.47","title":"Graph-Theoretic Models for Network Optimization","display_name":"Graph-Theoretic Models for Network Optimization","publication_year":2026,"publication_date":"2026-08-24","ids":{"openalex":"https://openalex.org/W7204451891","doi":"https://doi.org/10.67313/slijms.2026.47"},"language":"en","primary_location":{"id":"doi:10.67313/slijms.2026.47","doi":"https://doi.org/10.67313/slijms.2026.47","is_oa":true,"landing_page_url":"https://doi.org/10.67313/slijms.2026.47","pdf_url":null,"source":{"id":"https://openalex.org/S7407058957","display_name":"Stanzaleaf International Journal of Multidisciplinary Studies","issn_l":"3139-3373","issn":["3139-3373"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Stanzaleaf International Journal of Multidisciplinary Studies","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.67313/slijms.2026.47","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5148429381","display_name":"Dr. S. Anantharaman","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dr. S. Anantharaman","raw_affiliation_strings":["DMI college of Engineering"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"DMI college of Engineering","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5148410354","display_name":"Dr. V. Vishnupriya","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dr. V. Vishnupriya","raw_affiliation_strings":["DMI college of Engineering"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"DMI college of Engineering","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.401,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.80150273,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"3","issue":"1","first_page":null,"last_page":null},"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.7827000021934509,"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.7827000021934509,"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.17520000040531158,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.03400000184774399,"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/network-optimization","display_name":"network optimization","score":0.9739999771118164},{"id":"https://openalex.org/keywords/graph-model","display_name":"graph model","score":0.9599999785423279},{"id":"https://openalex.org/keywords/shortest-path","display_name":"shortest path","score":0.8149999976158142},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"minimum spanning tree","score":0.9980000257492065},{"id":"https://openalex.org/keywords/network-flow","display_name":"network flow","score":0.8190000057220459},{"id":"https://openalex.org/keywords/graph-cuts","display_name":"graph cuts","score":0.8009999990463257},{"id":"https://openalex.org/keywords/matching","display_name":"matching","score":0.8299999833106995},{"id":"https://openalex.org/keywords/centrality","display_name":"centrality","score":0.9340000152587891},{"id":"https://openalex.org/keywords/community-structure","display_name":"community structure","score":0.9879999756813049},{"id":"https://openalex.org/keywords/complex-networks","display_name":"complex networks","score":0.9729999899864197},{"id":"https://openalex.org/keywords/multilayer-networks","display_name":"multilayer networks","score":0.9950000047683716},{"id":"https://openalex.org/keywords/network-resilience","display_name":"network resilience","score":0.7519999742507935},{"id":"https://openalex.org/keywords/robust-optimization","display_name":"robust optimization","score":0.8460000157356262},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.9760000109672546},{"id":"https://openalex.org/keywords/network-design","display_name":"network design","score":0.6309999823570251},{"id":"https://openalex.org/keywords/dynamic-graphs","display_name":"dynamic graphs","score":0.6119999885559082},{"id":"https://openalex.org/keywords/uncertainty-aware-optimization","display_name":"uncertainty-aware optimization","score":0.9269999861717224}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6334999799728394},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.609499990940094},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5814999938011169},{"id":"https://openalex.org/C193254401","wikidata":"https://www.wikidata.org/wiki/Q2160088","display_name":"Robust optimization","level":2,"score":0.5130000114440918},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.476500004529953},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4352000057697296},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.4153999984264374},{"id":"https://openalex.org/C34947359","wikidata":"https://www.wikidata.org/wiki/Q665189","display_name":"Complex network","level":2,"score":0.41519999504089355},{"id":"https://openalex.org/C137753397","wikidata":"https://www.wikidata.org/wiki/Q2434424","display_name":"Network science","level":3,"score":0.387800008058548},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.3691999912261963},{"id":"https://openalex.org/C47822265","wikidata":"https://www.wikidata.org/wiki/Q854457","display_name":"Complex system","level":2,"score":0.3562999963760376},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.35249999165534973},{"id":"https://openalex.org/C2779193601","wikidata":"https://www.wikidata.org/wiki/Q20026918","display_name":"Mathematical theory","level":2,"score":0.351500004529953},{"id":"https://openalex.org/C144559511","wikidata":"https://www.wikidata.org/wiki/Q2986279","display_name":"Principal (computer security)","level":2,"score":0.3463999927043915},{"id":"https://openalex.org/C11804174","wikidata":"https://www.wikidata.org/wiki/Q1192971","display_name":"Network theory","level":2,"score":0.3375999927520752},{"id":"https://openalex.org/C76969082","wikidata":"https://www.wikidata.org/wiki/Q486902","display_name":"Mathematical model","level":2,"score":0.3269999921321869},{"id":"https://openalex.org/C13540734","wikidata":"https://www.wikidata.org/wiki/Q5318996","display_name":"Dynamic network analysis","level":2,"score":0.3003000020980835},{"id":"https://openalex.org/C32946077","wikidata":"https://www.wikidata.org/wiki/Q618079","display_name":"Network analysis","level":2,"score":0.2989000082015991},{"id":"https://openalex.org/C3309286","wikidata":"https://www.wikidata.org/wiki/Q4907693","display_name":"Bilevel optimization","level":3,"score":0.29019999504089355},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.2874999940395355},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.2806999981403351},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.2750000059604645},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.27000001072883606},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26750001311302185},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.26510000228881836},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2612999975681305},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.2556999921798706},{"id":"https://openalex.org/C104122410","wikidata":"https://www.wikidata.org/wiki/Q1416406","display_name":"Network model","level":2,"score":0.25450000166893005}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.67313/slijms.2026.47","doi":"https://doi.org/10.67313/slijms.2026.47","is_oa":true,"landing_page_url":"https://doi.org/10.67313/slijms.2026.47","pdf_url":null,"source":{"id":"https://openalex.org/S7407058957","display_name":"Stanzaleaf International Journal of Multidisciplinary Studies","issn_l":"3139-3373","issn":["3139-3373"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Stanzaleaf International Journal of Multidisciplinary Studies","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.67313/slijms.2026.47","doi":"https://doi.org/10.67313/slijms.2026.47","is_oa":true,"landing_page_url":"https://doi.org/10.67313/slijms.2026.47","pdf_url":null,"source":{"id":"https://openalex.org/S7407058957","display_name":"Stanzaleaf International Journal of Multidisciplinary Studies","issn_l":"3139-3373","issn":["3139-3373"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Stanzaleaf International Journal of Multidisciplinary Studies","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.5378999710083008,"display_name":"Industry, innovation and infrastructure"}],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W7221610135","https://openalex.org/W4410752034","https://openalex.org/W7154605504","https://openalex.org/W7213264136","https://openalex.org/W4409904169","https://openalex.org/W2289803264","https://openalex.org/W4236853494","https://openalex.org/W7220639157","https://openalex.org/W7054741297","https://openalex.org/W2984677551"],"abstract_inverted_index":{"Networks":[0],"provide":[1],"the":[2,193],"structural":[3,75,213],"foundation":[4],"for":[5,88,159,169],"transportation":[6],"systems,":[7,15],"communication":[8],"infrastructures,":[9],"supply":[10],"chains,":[11],"power":[12],"grids,":[13],"information":[14],"social":[16],"interactions,":[17],"and":[18,23,29,43,61,74,98,120,139,176,185,219,234],"many":[19],"other":[20],"complex":[21,118],"technological":[22],"socioeconomic":[24],"processes.":[25],"The":[26,149,189],"growing":[27],"scale":[28],"interdependence":[30],"of":[31,41,68,95,196],"such":[32],"systems":[33,178],"have":[34],"made":[35],"network":[36,54,89,109],"optimization":[37,81,90,125,198],"an":[38,92],"important":[39],"area":[40],"mathematical":[42,147,240],"computational":[44,187],"research.":[45],"Graph":[46],"theory":[47],"offers":[48],"a":[49,145],"rigorous":[50],"framework":[51,126],"in":[52,129,202,211],"which":[53,130],"entities":[55],"can":[56,141],"be":[57,78,142],"represented":[58],"as":[59,64,80],"vertices":[60],"their":[62],"relationships":[63],"edges,":[65],"allowing":[66],"questions":[67],"routing,":[69],"connectivity,":[70,117,138],"allocation,":[71,134],"capacity,":[72,137],"resilience,":[73],"efficiency":[76,218],"to":[77],"formulated":[79],"problems.":[82],"This":[83],"paper":[84],"examines":[85],"graph-theoretic":[86,197],"models":[87],"through":[91],"integrated":[93],"review":[94],"classical":[96],"algorithms":[97,165],"contemporary":[99],"network-science":[100],"approaches.":[101],"It":[102],"discusses":[103],"shortest-path":[104],"models,":[105],"minimum":[106],"spanning":[107],"trees,":[108],"flows,":[110],"cuts,":[111],"matching,":[112],"centrality,":[113],"community":[114],"structure,":[115],"spectral":[116,232],"networks,":[119],"multilayer":[121,230],"representations.":[122],"A":[123],"generalized":[124],"is":[127,157],"proposed":[128],"edge":[131],"selection,":[132],"flow":[133],"operational":[135],"cost,":[136],"robustness":[140],"considered":[143],"within":[144],"common":[146],"structure.":[148],"analysis":[150],"demonstrates":[151],"that":[152,192,215],"no":[153],"single":[154],"graph":[155],"model":[156],"sufficient":[158],"every":[160],"network-design":[161],"problem.":[162],"Classical":[163],"polynomial-time":[164],"remain":[166],"highly":[167],"effective":[168],"well-structured":[170],"problems,":[171],"while":[172,238],"large,":[173],"uncertain,":[174],"multilayer,":[175],"combinatorial":[177],"increasingly":[179],"require":[180],"approximation,":[181],"decomposition,":[182],"robust":[183],"optimization,":[184,229],"hybrid":[186],"strategies.":[188],"study":[190],"argues":[191],"principal":[194],"value":[195],"lies":[199],"not":[200],"only":[201],"identifying":[203],"minimum-cost":[204],"paths":[205],"or":[206],"maximum":[207],"flows":[208],"but":[209],"also":[210],"representing":[212],"dependencies":[214],"influence":[216],"system-wide":[217],"resilience.":[220],"Future":[221],"research":[222],"should":[223],"therefore":[224],"integrate":[225],"dynamic":[226],"graphs,":[227],"uncertainty-aware":[228],"modeling,":[231],"methods,":[233],"data-driven":[235],"decision":[236],"support":[237],"preserving":[239],"interpretability.":[241]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-11-10T11:39:43.021295","created_date":"2026-08-28T00:00:00"}