{"id":"https://openalex.org/W2919132586","doi":"https://doi.org/10.1109/tencon.2018.8650418","title":"Depth-First Search Algorithms for Finding a Generalized Moore Graph","display_name":"Depth-First Search Algorithms for Finding a Generalized Moore Graph","publication_year":2018,"publication_date":"2018-10-01","ids":{"openalex":"https://openalex.org/W2919132586","doi":"https://doi.org/10.1109/tencon.2018.8650418","mag":"2919132586"},"language":"en","primary_location":{"id":"doi:10.1109/tencon.2018.8650418","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tencon.2018.8650418","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"TENCON 2018 - 2018 IEEE Region 10 Conference","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/A5015324466","display_name":"Yoshiki Satotani","orcid":null},"institutions":[{"id":"https://openalex.org/I163770644","display_name":"Okayama University","ror":"https://ror.org/02pc6pc55","country_code":"JP","type":"education","lineage":["https://openalex.org/I163770644"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yoshiki Satotani","raw_affiliation_strings":["Graduate School of Natural Science and Technology, Okayama University, Okayama, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Natural Science and Technology, Okayama University, Okayama, Japan","institution_ids":["https://openalex.org/I163770644"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016732558","display_name":"Norikazu Takahashi","orcid":"https://orcid.org/0000-0001-8222-5593"},"institutions":[{"id":"https://openalex.org/I163770644","display_name":"Okayama University","ror":"https://ror.org/02pc6pc55","country_code":"JP","type":"education","lineage":["https://openalex.org/I163770644"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Norikazu Takahashi","raw_affiliation_strings":["Graduate School of Natural Science and Technology, Okayama University, Okayama, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Natural Science and Technology, Okayama University, Okayama, Japan","institution_ids":["https://openalex.org/I163770644"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.212,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.58985649,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"0832","last_page":"0837"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/computer-science","display_name":"Computer science","score":0.6747846603393555},{"id":"https://openalex.org/keywords/breadth-first-search","display_name":"Breadth-first search","score":0.47094595432281494},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4584199786186218},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4556955397129059},{"id":"https://openalex.org/keywords/depth-first-search","display_name":"Depth-first search","score":0.4490925073623657},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41187068819999695},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.3569156229496002}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6747846603393555},{"id":"https://openalex.org/C138843760","wikidata":"https://www.wikidata.org/wiki/Q325904","display_name":"Breadth-first search","level":2,"score":0.47094595432281494},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4584199786186218},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4556955397129059},{"id":"https://openalex.org/C62692426","wikidata":"https://www.wikidata.org/wiki/Q816319","display_name":"Depth-first search","level":3,"score":0.4490925073623657},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41187068819999695},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.3569156229496002}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tencon.2018.8650418","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tencon.2018.8650418","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"TENCON 2018 - 2018 IEEE Region 10 Conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1963600265","https://openalex.org/W1981159511","https://openalex.org/W2050883310","https://openalex.org/W2113933854","https://openalex.org/W2130531694","https://openalex.org/W2157614013","https://openalex.org/W2163769126","https://openalex.org/W2597122634","https://openalex.org/W3145732157","https://openalex.org/W4297816311","https://openalex.org/W6684402220","https://openalex.org/W7067408483"],"related_works":["https://openalex.org/W3098335909","https://openalex.org/W2037710955","https://openalex.org/W2376570066","https://openalex.org/W2354057059","https://openalex.org/W2985498454","https://openalex.org/W2378762226","https://openalex.org/W4226337883","https://openalex.org/W4379471634","https://openalex.org/W2181360821","https://openalex.org/W1973053649"],"abstract_inverted_index":{"Computer":[0],"networks":[1],"in":[2],"data":[3,27],"centers":[4],"are":[5],"often":[6],"modeled":[7],"by":[8,115],"undirected":[9,33,51],"regular":[10,34,52],"graphs,":[11],"and":[12,84,111],"the":[13,20,26,37,67,95],"average":[14],"shortest":[15],"path":[16],"length":[17],"(ASPL)":[18],"of":[19,94,97],"graph":[21,35,53,59],"is":[22,40,54,64],"closely":[23],"related":[24],"to":[25,78],"transmission":[28],"latency.":[29],"Therefore,":[30],"finding":[31,108],"an":[32,41],"with":[36,66,81],"minimum":[38],"ASPL":[39,63],"important":[42],"problem":[43],"for":[44,107],"building":[45],"a":[46,56,91,109],"low":[47],"latency":[48],"network.":[49],"An":[50],"called":[55],"generalized":[57],"Moore":[58],"(GMG)":[60],"when":[61],"its":[62],"identical":[65],"theoretical":[68],"lower":[69],"bound.":[70],"Several":[71],"methods":[72],"have":[73],"been":[74],"proposed":[75],"so":[76],"far":[77],"find":[79],"GMGs":[80],"given":[82],"order":[83],"degree.":[85],"However,":[86],"they":[87],"do":[88],"not":[89],"make":[90],"full":[92],"use":[93],"properties":[96],"GMGs.":[98],"In":[99],"this":[100],"paper,":[101],"we":[102],"propose":[103],"some":[104],"efficient":[105],"algorithms":[106],"GMG":[110],"examine":[112],"their":[113],"effectiveness":[114],"experiments.":[116]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}