{"id":"https://openalex.org/W3185516383","doi":"https://doi.org/10.1142/s1793830921501202","title":"Finding the shortest path for a Hypergraph","display_name":"Finding the shortest path for a Hypergraph","publication_year":2021,"publication_date":"2021-07-24","ids":{"openalex":"https://openalex.org/W3185516383","doi":"https://doi.org/10.1142/s1793830921501202","mag":"3185516383"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830921501202","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830921501202","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-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/A5048401744","display_name":"Gholam Hassan Shirdel","orcid":"https://orcid.org/0000-0003-2759-4606"},"institutions":[{"id":"https://openalex.org/I184468904","display_name":"University of Qom","ror":"https://ror.org/03ddeer04","country_code":"IR","type":"education","lineage":["https://openalex.org/I184468904"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"G. H. Shirdel","raw_affiliation_strings":["Department of Mathematics, Faculty of Sciences University of Qom, Qom, Iran"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Faculty of Sciences University of Qom, Qom, Iran","institution_ids":["https://openalex.org/I184468904"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019156030","display_name":"B. Vaez-Zadeh","orcid":null},"institutions":[{"id":"https://openalex.org/I184468904","display_name":"University of Qom","ror":"https://ror.org/03ddeer04","country_code":"IR","type":"education","lineage":["https://openalex.org/I184468904"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"B. Vaez-Zadeh","raw_affiliation_strings":["Department of Mathematics, Faculty of Sciences University of Qom, Qom, Iran"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Faculty of Sciences University of Qom, Qom, Iran","institution_ids":["https://openalex.org/I184468904"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5048401744"],"corresponding_institution_ids":["https://openalex.org/I184468904"],"apc_list":null,"apc_paid":null,"fwci":0.148,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.50891167,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"14","issue":"03","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9997000098228455,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.8502218723297119},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7348690032958984},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5714308023452759},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4841199815273285}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.8502218723297119},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7348690032958984},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5714308023452759},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4841199815273285}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793830921501202","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830921501202","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W3149335","https://openalex.org/W1484040084","https://openalex.org/W1582582384","https://openalex.org/W1971712900","https://openalex.org/W1996409523","https://openalex.org/W2001029390","https://openalex.org/W2029485128","https://openalex.org/W2097642692","https://openalex.org/W2103078247","https://openalex.org/W2498848698"],"related_works":["https://openalex.org/W4376608589","https://openalex.org/W3138003926","https://openalex.org/W4300037846","https://openalex.org/W1630514295","https://openalex.org/W1537073411","https://openalex.org/W2963081352","https://openalex.org/W2472555608","https://openalex.org/W3094179932","https://openalex.org/W3005801850","https://openalex.org/W2950595062"],"abstract_inverted_index":{"A":[0,50],"hypergraph":[1,42,51,63,96],"is":[2,12,21,37,43],"given":[3],"by":[4,100],"[Formula:":[5,9,18,28,34,97,113],"see":[6,10,19,29,35,98,114],"text],":[7,30,99],"where":[8],"text]":[11,20,36],"a":[13,22,41,44,48,53,62,65,95],"set":[14,23],"of":[15,24,27,33,47],"vertices":[16,93],"and":[17,76],"nonempty":[25],"subsets":[26],"the":[31,88,102,109],"member":[32],"named":[38],"hyperedge.":[39],"So,":[40],"nature":[45],"generalization":[46],"graph.":[49,66,78],"has":[52],"complex":[54],"structure,":[55],"thus":[56],"some":[57],"researchers":[58],"try":[59],"to":[60,64,83,112],"transform":[61],"In":[67],"this":[68],"paper,":[69],"we":[70],"define":[71],"two":[72,92],"graphs,":[73],"Clique":[74],"graph":[75,106],"Persian":[77],"These":[79],"relations":[80],"are":[81],"one":[82],"one.":[84],"We":[85],"can":[86],"find":[87],"shortest":[89],"path":[90],"between":[91],"in":[94,105],"using":[101],"Dijkstra":[103],"algorithm":[104],"theory":[107],"on":[108],"graphs":[110],"corresponding":[111],"text].":[115]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}