{"id":"https://openalex.org/W2120120493","doi":"https://doi.org/10.1109/ispan.2002.1004279","title":"Embedding Hamiltonian paths and Hamiltonian cycles in faulty pancake graphs","display_name":"Embedding Hamiltonian paths and Hamiltonian cycles in faulty pancake graphs","publication_year":2003,"publication_date":"2003-06-25","ids":{"openalex":"https://openalex.org/W2120120493","doi":"https://doi.org/10.1109/ispan.2002.1004279","mag":"2120120493"},"language":"en","primary_location":{"id":"doi:10.1109/ispan.2002.1004279","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ispan.2002.1004279","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02","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/A5071030184","display_name":"Chun\u2010Nan Hung","orcid":null},"institutions":[{"id":"https://openalex.org/I130510345","display_name":"Dayeh University","ror":"https://ror.org/03c6e8r26","country_code":"TW","type":"education","lineage":["https://openalex.org/I130510345"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Chun-Nan Hung","raw_affiliation_strings":["Department of Computer Science and Information Engineering, Da-Yeh University, Changhua, Taiwan","Dept. of Comput. Sci. & Inf. Eng., Da-Yet Univ., Changhua, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Engineering, Da-Yeh University, Changhua, Taiwan","institution_ids":["https://openalex.org/I130510345"]},{"raw_affiliation_string":"Dept. of Comput. Sci. & Inf. Eng., Da-Yet Univ., Changhua, Taiwan","institution_ids":["https://openalex.org/I130510345"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067035012","display_name":"Kao-Yung Liang","orcid":null},"institutions":[{"id":"https://openalex.org/I130510345","display_name":"Dayeh University","ror":"https://ror.org/03c6e8r26","country_code":"TW","type":"education","lineage":["https://openalex.org/I130510345"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Kao-Yung Liang","raw_affiliation_strings":["Department of Computer Science and Information Engineering, Da-Yeh University, Changhua, Taiwan","Dept. of Comput. Sci. & Inf. Eng., Da-Yet Univ., Changhua, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Engineering, Da-Yeh University, Changhua, Taiwan","institution_ids":["https://openalex.org/I130510345"]},{"raw_affiliation_string":"Dept. of Comput. Sci. & Inf. Eng., Da-Yet Univ., Changhua, Taiwan","institution_ids":["https://openalex.org/I130510345"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111885973","display_name":"Lih-Hsing Hsu","orcid":null},"institutions":[{"id":"https://openalex.org/I148366613","display_name":"National Yang Ming Chiao Tung University","ror":"https://ror.org/00se2k293","country_code":"TW","type":"education","lineage":["https://openalex.org/I148366613"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Lih-Hsing Hsu","raw_affiliation_strings":["Department of Computer and Information Science, National Chiao Tung University, Hsinchu, Taiwan","Dept. of Comput. & Inf. Sci., National Chiao Tung Univ., Hsinchu, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science, National Chiao Tung University, Hsinchu, Taiwan","institution_ids":["https://openalex.org/I148366613"]},{"raw_affiliation_string":"Dept. of Comput. & Inf. Sci., National Chiao Tung Univ., Hsinchu, Taiwan","institution_ids":["https://openalex.org/I148366613"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7454,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.78590597,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"4","issue":null,"first_page":"179","last_page":"184"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10179","display_name":"Supercapacitor Materials and Fabrication","score":0.9523000121116638,"subfield":{"id":"https://openalex.org/subfields/2504","display_name":"Electronic, Optical and Magnetic Materials"},"field":{"id":"https://openalex.org/fields/25","display_name":"Materials 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.9463000297546387,"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/hamiltonian-path","display_name":"Hamiltonian path","score":0.8338141441345215},{"id":"https://openalex.org/keywords/hamiltonian","display_name":"Hamiltonian (control theory)","score":0.6282790899276733},{"id":"https://openalex.org/keywords/hamiltonian-path-problem","display_name":"Hamiltonian path problem","score":0.5997493267059326},{"id":"https://openalex.org/keywords/interconnection","display_name":"Interconnection","score":0.5869612693786621},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.5762783885002136},{"id":"https://openalex.org/keywords/fault-tolerance","display_name":"Fault tolerance","score":0.5349112153053284},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4482088088989258},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4241657853126526},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4221658706665039},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4082772135734558},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3962985873222351},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.3276407718658447},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.14402452111244202},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09717553853988647},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.0866897702217102}],"concepts":[{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.8338141441345215},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.6282790899276733},{"id":"https://openalex.org/C104737047","wikidata":"https://www.wikidata.org/wiki/Q987652","display_name":"Hamiltonian path problem","level":4,"score":0.5997493267059326},{"id":"https://openalex.org/C123745756","wikidata":"https://www.wikidata.org/wiki/Q1665949","display_name":"Interconnection","level":2,"score":0.5869612693786621},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.5762783885002136},{"id":"https://openalex.org/C63540848","wikidata":"https://www.wikidata.org/wiki/Q3140932","display_name":"Fault tolerance","level":2,"score":0.5349112153053284},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4482088088989258},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4241657853126526},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4221658706665039},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4082772135734558},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3962985873222351},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3276407718658447},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.14402452111244202},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09717553853988647},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.0866897702217102},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ispan.2002.1004279","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ispan.2002.1004279","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W42780094","https://openalex.org/W78947073","https://openalex.org/W120553696","https://openalex.org/W1566364654","https://openalex.org/W1963483878","https://openalex.org/W1990269643","https://openalex.org/W1999212995","https://openalex.org/W1999836348","https://openalex.org/W2022272738","https://openalex.org/W2104852618","https://openalex.org/W2137422654","https://openalex.org/W6601677616","https://openalex.org/W6604895793"],"related_works":["https://openalex.org/W4387272283","https://openalex.org/W4299647289","https://openalex.org/W1618127724","https://openalex.org/W2155631825","https://openalex.org/W2952856011","https://openalex.org/W2011032737","https://openalex.org/W2078431586","https://openalex.org/W2069133957","https://openalex.org/W140019436","https://openalex.org/W4243020994"],"abstract_inverted_index":{"The":[0,17],"use":[1],"of":[2],"pancake":[3,37,65],"and":[4],"star":[5],"networks":[6,22],"as":[7],"an":[8,25,34],"interconnection":[9],"network":[10],"has":[11],"been":[12],"studied":[13],"by":[14],"many":[15],"researchers.":[16],"fault":[18],"tolerance":[19],"for":[20],"Hamiltonian":[21,41,54],"is":[23],"also":[24],"important":[26],"issue.":[27],"In":[28],"this":[29],"paper,":[30],"we":[31],"prove":[32],"that":[33],"n-dimensional":[35],"faulty":[36,64],"graph":[38,66],"contains":[39],"a":[40,63],"cycle":[42],"with":[43,67],"|F|":[44,68],"/spl":[45,69],"les/":[46,70],"n":[47,71],"-":[48,72],"3":[49],"faults.":[50,74],"Furthermore,":[51],"there":[52],"exist":[53],"paths":[55],"between":[56],"two":[57],"arbitrary":[58],"but":[59],"distinct":[60],"nodes":[61],"in":[62],"4":[73]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}