{"id":"https://openalex.org/W6889835302","doi":"https://doi.org/10.26262/heal.auth.ir.363242","title":"Performance Evaluation of Core Maximization Algorithms in Graphs","display_name":"Performance Evaluation of Core Maximization Algorithms in Graphs","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W6889835302","doi":"https://doi.org/10.26262/heal.auth.ir.363242"},"language":"en","primary_location":{"id":"doi:10.26262/heal.auth.ir.363242","doi":"https://doi.org/10.26262/heal.auth.ir.363242","is_oa":true,"landing_page_url":"https://doi.org/10.26262/heal.auth.ir.363242","pdf_url":null,"source":{"id":"https://openalex.org/S7407051609","display_name":"Aristotle University of Thessaloniki","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I21370196","host_organization_name":"Aristotle University of Thessaloniki","host_organization_lineage":["https://openalex.org/I21370196"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"volume":null,"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.26262/heal.auth.ir.363242","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"\u03a0\u03bf\u03bb\u03c5\u03c7\u03c1\u03bf\u03bd\u03af\u03b4\u03b7\u03c2, \u039d\u03b9\u03ba\u03cc\u03bb\u03b1\u03bf\u03c2 \u0391.","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"\u03a0\u03bf\u03bb\u03c5\u03c7\u03c1\u03bf\u03bd\u03af\u03b4\u03b7\u03c2, \u039d\u03b9\u03ba\u03cc\u03bb\u03b1\u03bf\u03c2 \u0391.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.29004991,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.48100000619888306,"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"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.48100000619888306,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.4745999872684479,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.026599999517202377,"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/graph-cores","display_name":"graph cores","score":0.6370000243186951},{"id":"https://openalex.org/keywords/number-of-cores","display_name":"core number","score":0.48500001430511475},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"graph algorithms","score":0.6370000243186951},{"id":"https://openalex.org/keywords/algorithm-performance-evaluation","display_name":"algorithm performance evaluation","score":0.8659999966621399},{"id":"https://openalex.org/keywords/graph-theory","display_name":"graph theory","score":0.37400001287460327}],"concepts":[{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.6513000130653381},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5691999793052673},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5663999915122986},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5055000185966492},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.45669999718666077},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3765000104904175},{"id":"https://openalex.org/C2778334786","wikidata":"https://www.wikidata.org/wiki/Q1586270","display_name":"Variation (astronomy)","level":2,"score":0.3675999939441681},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35040000081062317},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.3287999927997589},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.305400013923645},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.2969000041484833},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.2896000146865845},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.28760001063346863},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2847999930381775},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.2840999960899353},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2768000066280365}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.26262/heal.auth.ir.363242","doi":"https://doi.org/10.26262/heal.auth.ir.363242","is_oa":true,"landing_page_url":"https://doi.org/10.26262/heal.auth.ir.363242","pdf_url":null,"source":{"id":"https://openalex.org/S7407051609","display_name":"Aristotle University of Thessaloniki","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I21370196","host_organization_name":"Aristotle University of Thessaloniki","host_organization_lineage":["https://openalex.org/I21370196"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.26262/heal.auth.ir.363242","doi":"https://doi.org/10.26262/heal.auth.ir.363242","is_oa":true,"landing_page_url":"https://doi.org/10.26262/heal.auth.ir.363242","pdf_url":null,"source":{"id":"https://openalex.org/S7407051609","display_name":"Aristotle University of Thessaloniki","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I21370196","host_organization_name":"Aristotle University of Thessaloniki","host_organization_lineage":["https://openalex.org/I21370196"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"purpose":[1],"of":[2,60,73],"the":[3,15,25,29,61],"thesis":[4],"was":[5],"to":[6,49],"study":[7],"core":[8],"maximization":[9],"algorithms":[10,27,38,62],"in":[11,28,42,81],"graphs.":[12],"We":[13,53],"examined":[14],"fundamental":[16],"theorems":[17],"that":[18,31],"govern":[19],"our":[20,55],"problem":[21],"as":[22,24],"well":[23],"existing":[26],"literature":[30],"address":[32],"it.":[33],"Furthermore,":[34],"we":[35,40,63,66],"selected":[36],"specific":[37],"which":[39],"implemented":[41],"a":[43,70,78],"programming":[44],"environment":[45],"and":[46,65,76],"performed":[47],"experiments":[48],"determine":[50],"their":[51],"effectiveness.":[52],"formulated":[54],"own":[56],"theorem":[57],"for":[58,84],"one":[59],"examined,":[64],"also":[67],"dealt":[68],"with":[69],"different":[71],"variation":[72],"these":[74],"problems":[75],"propose":[77],"first":[79],"algorithm":[80],"pseudocode":[82],"form":[83],"its":[85],"solution.":[86]},"counts_by_year":[],"updated_date":"2026-08-13T07:04:57.449891","created_date":"2025-10-10T00:00:00"}