{"id":"https://openalex.org/W4415250826","doi":"https://doi.org/10.1109/hpec67600.2025.11196278","title":"Degree Matrix Comparison for Graph Alignment","display_name":"Degree Matrix Comparison for Graph Alignment","publication_year":2025,"publication_date":"2025-09-15","ids":{"openalex":"https://openalex.org/W4415250826","doi":"https://doi.org/10.1109/hpec67600.2025.11196278"},"language":"en","primary_location":{"id":"doi:10.1109/hpec67600.2025.11196278","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpec67600.2025.11196278","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE High Performance Extreme Computing Conference (HPEC)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5114948602","display_name":"Ashley Wang","orcid":null},"institutions":[{"id":"https://openalex.org/I107672454","display_name":"Dartmouth College","ror":"https://ror.org/049s0rh22","country_code":"US","type":"education","lineage":["https://openalex.org/I107672454"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ashley Wang","raw_affiliation_strings":["Dartmouth College,Department of Mathematics,Hanover,NH,USA"],"affiliations":[{"raw_affiliation_string":"Dartmouth College,Department of Mathematics,Hanover,NH,USA","institution_ids":["https://openalex.org/I107672454"]}]},{"author_position":"last","author":{"id":null,"display_name":"Peter Chin","orcid":null},"institutions":[{"id":"https://openalex.org/I107672454","display_name":"Dartmouth College","ror":"https://ror.org/049s0rh22","country_code":"US","type":"education","lineage":["https://openalex.org/I107672454"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Peter Chin","raw_affiliation_strings":["Dartmouth College,Thayer School of Engineering,Hanover,NH,USA"],"affiliations":[{"raw_affiliation_string":"Dartmouth College,Thayer School of Engineering,Hanover,NH,USA","institution_ids":["https://openalex.org/I107672454"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5114948602"],"corresponding_institution_ids":["https://openalex.org/I107672454"],"apc_list":null,"apc_paid":null,"fwci":1.163,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.83563487,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9933000206947327,"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.9933000206947327,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.958299994468689,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10215","display_name":"Semantic Web and Ontologies","score":0.9545999765396118,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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","display_name":"Graph","score":0.5432999730110168},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4961000084877014},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.44909998774528503},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4368000030517578},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4348999857902527},{"id":"https://openalex.org/keywords/adjacency-matrix","display_name":"Adjacency matrix","score":0.40389999747276306},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.37630000710487366},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.365200012922287},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.35339999198913574}],"concepts":[{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5432999730110168},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4961000084877014},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.44909998774528503},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4447000026702881},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4368000030517578},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4348999857902527},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4345000088214874},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43130001425743103},{"id":"https://openalex.org/C180356752","wikidata":"https://www.wikidata.org/wiki/Q727035","display_name":"Adjacency matrix","level":3,"score":0.40389999747276306},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.37630000710487366},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.365200012922287},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.35339999198913574},{"id":"https://openalex.org/C88031987","wikidata":"https://www.wikidata.org/wiki/Q1377767","display_name":"Multiple sequence alignment","level":5,"score":0.337799996137619},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3328000009059906},{"id":"https://openalex.org/C97042676","wikidata":"https://www.wikidata.org/wiki/Q5597097","display_name":"Graph reduction","level":3,"score":0.32019999623298645},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3052000105381012},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.30149999260902405},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2996000051498413},{"id":"https://openalex.org/C85136909","wikidata":"https://www.wikidata.org/wiki/Q939272","display_name":"Incidence matrix","level":3,"score":0.2985999882221222},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.29829999804496765},{"id":"https://openalex.org/C53052385","wikidata":"https://www.wikidata.org/wiki/Q17104046","display_name":"Mixed graph","level":5,"score":0.29809999465942383},{"id":"https://openalex.org/C54848796","wikidata":"https://www.wikidata.org/wiki/Q339011","display_name":"Symmetric matrix","level":3,"score":0.2924000024795532},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.2872999906539917},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.28060001134872437},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.2791000008583069},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.26350000500679016},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.25529998540878296},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.25270000100135803}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hpec67600.2025.11196278","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpec67600.2025.11196278","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE High Performance Extreme Computing Conference (HPEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320332815","display_name":"Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W217162355","https://openalex.org/W1552468722","https://openalex.org/W2018049970","https://openalex.org/W2052104835","https://openalex.org/W2056124433","https://openalex.org/W2057869046","https://openalex.org/W2058036501","https://openalex.org/W2107427454","https://openalex.org/W2112090702","https://openalex.org/W2130237248","https://openalex.org/W2146008005","https://openalex.org/W2149342630","https://openalex.org/W2163318198","https://openalex.org/W2294347342","https://openalex.org/W2391555403","https://openalex.org/W2557169239","https://openalex.org/W2578633072","https://openalex.org/W2613369402","https://openalex.org/W2888657195","https://openalex.org/W2944982573","https://openalex.org/W2970921796","https://openalex.org/W2993855452","https://openalex.org/W3129433809","https://openalex.org/W3171051766","https://openalex.org/W3176947119","https://openalex.org/W4242440301","https://openalex.org/W4308834893"],"related_works":[],"abstract_inverted_index":{"The":[0,128],"graph":[1,25,136],"alignment":[2,26,35,76],"problem,":[3],"which":[4],"considers":[5],"the":[6,32,63,115,121,126,142],"optimal":[7],"node":[8,75],"correspondence":[9],"across":[10],"networks,":[11],"has":[12,47,101],"recently":[13],"gained":[14],"significant":[15],"attention":[16],"due":[17],"to":[18,49,72,120],"its":[19],"wide":[20],"applications.":[21],"There":[22],"are":[23],"various":[24],"methods,":[27],"but":[28],"we":[29,61,87],"focus":[30],"on":[31],"unsupervised":[33],"geometric":[34],"algorithms.":[36],"We":[37],"propose":[38,88],"Degree":[39],"Matrix":[40],"Comparison":[41],"(DMC),":[42],"a":[43,89],"degree-based":[44],"method":[45],"that":[46,100],"shown":[48],"be":[50],"effective":[51],"for":[52,77,83,104,141],"heterogeneous":[53],"networks.":[54],"Through":[55],"extensive":[56],"experiments":[57],"and":[58,80,97,114,123],"mathematical":[59],"proofs,":[60],"demonstrate":[62],"potential":[64,103,124],"of":[65,125,130],"this":[66],"method.":[67],"Remarkably,":[68],"DMC":[69,92,99,113,117,131],"achieves":[70],"up":[71],"99%":[73],"correct":[74],"90%-overlap":[78],"networks":[79],"100%":[81],"accuracy":[82],"isomorphic":[84],"graphs.":[85,107],"Additionally,":[86],"reduced":[90],"Greedy":[91,112],"with":[93],"lower":[94],"time":[95],"complexity":[96],"Weighted":[98,116],"demonstrated":[102],"aligning":[105],"weighted":[106],"Positive":[108],"results":[109],"from":[110],"applying":[111],"furthermore":[118],"speaks":[119],"validity":[122],"DMC.":[127],"sequence":[129],"methods":[132],"could":[133],"significantly":[134],"impact":[135],"alignment,":[137],"offering":[138],"reliable":[139],"solutions":[140],"task.":[143]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-16T00:00:00"}