{"id":"https://openalex.org/W2993421093","doi":"https://doi.org/10.1109/icawst.2019.8923400","title":"Finding Longest (s, t)-paths of O-shaped Supergrid Graphs in Linear Time","display_name":"Finding Longest (s, t)-paths of O-shaped Supergrid Graphs in Linear Time","publication_year":2019,"publication_date":"2019-10-01","ids":{"openalex":"https://openalex.org/W2993421093","doi":"https://doi.org/10.1109/icawst.2019.8923400","mag":"2993421093"},"language":"en","primary_location":{"id":"doi:10.1109/icawst.2019.8923400","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icawst.2019.8923400","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE 10th International Conference on Awareness Science and Technology (iCAST)","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/A5073783297","display_name":"Ruo-Wei Hung","orcid":"https://orcid.org/0000-0001-5803-2265"},"institutions":[{"id":"https://openalex.org/I126145234","display_name":"Chaoyang University of Technology","ror":"https://ror.org/04xwksx09","country_code":"TW","type":"education","lineage":["https://openalex.org/I126145234"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Ruo-Wei Hung","raw_affiliation_strings":["Department of Computer Science and Information Engineering, Chaoyang University of Technology, Taichung, Taiwan"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Engineering, Chaoyang University of Technology, Taichung, Taiwan","institution_ids":["https://openalex.org/I126145234"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065431653","display_name":"Fatemeh Keshavarz-Kohjerdi","orcid":"https://orcid.org/0000-0002-7006-2675"},"institutions":[{"id":"https://openalex.org/I119025939","display_name":"Shahed University","ror":"https://ror.org/01e8ff003","country_code":"IR","type":"education","lineage":["https://openalex.org/I119025939"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Fatemeh Keshavarz-Kohjerdi","raw_affiliation_strings":["Department of Mathematics and Computer Science, Shahed University, Tehran, Iran"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Shahed University, Tehran, Iran","institution_ids":["https://openalex.org/I119025939"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056286081","display_name":"Yuh\u2010Min Tseng","orcid":"https://orcid.org/0000-0003-0860-7766"},"institutions":[{"id":"https://openalex.org/I70522481","display_name":"National Changhua University of Education","ror":"https://ror.org/005gkfa10","country_code":"TW","type":"education","lineage":["https://openalex.org/I70522481"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Yuh-Min Tseng","raw_affiliation_strings":["Department of Mathematics, National Changhua University of Education, Changhua, Taiwan"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, National Changhua University of Education, Changhua, Taiwan","institution_ids":["https://openalex.org/I70522481"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016077723","display_name":"Guo-Hao Qiu","orcid":null},"institutions":[{"id":"https://openalex.org/I126145234","display_name":"Chaoyang University of Technology","ror":"https://ror.org/04xwksx09","country_code":"TW","type":"education","lineage":["https://openalex.org/I126145234"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Guo-Hao Qiu","raw_affiliation_strings":["Department of Computer Science and Information Engineering, Chaoyang University of Technology, Taichung, Taiwan"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Engineering, Chaoyang University of Technology, Taichung, Taiwan","institution_ids":["https://openalex.org/I126145234"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5073783297"],"corresponding_institution_ids":["https://openalex.org/I126145234"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.18903995,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"i","issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9991000294685364,"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.9991000294685364,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9976999759674072,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9973000288009644,"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/combinatorics","display_name":"Combinatorics","score":0.658048689365387},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.5773729681968689},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.5487726926803589},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.4969981014728546},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.48548200726509094},{"id":"https://openalex.org/keywords/modular-decomposition","display_name":"Modular decomposition","score":0.4805367588996887},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4614409804344177},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4519502818584442},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44974592328071594},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4403040409088135},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.347553551197052},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3117770850658417},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.16530823707580566}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.658048689365387},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.5773729681968689},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.5487726926803589},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.4969981014728546},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.48548200726509094},{"id":"https://openalex.org/C187407849","wikidata":"https://www.wikidata.org/wiki/Q6889712","display_name":"Modular decomposition","level":5,"score":0.4805367588996887},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4614409804344177},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4519502818584442},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44974592328071594},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4403040409088135},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.347553551197052},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3117770850658417},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.16530823707580566}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icawst.2019.8923400","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icawst.2019.8923400","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE 10th International Conference on Awareness Science and Technology (iCAST)","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":13,"referenced_works":["https://openalex.org/W1484040084","https://openalex.org/W2011039300","https://openalex.org/W2055336889","https://openalex.org/W2091151333","https://openalex.org/W2188309853","https://openalex.org/W2725940624","https://openalex.org/W2928534012","https://openalex.org/W2963874483","https://openalex.org/W2969955840","https://openalex.org/W4232336108","https://openalex.org/W4288375650","https://openalex.org/W4361867857","https://openalex.org/W6841072530"],"related_works":["https://openalex.org/W2106934213","https://openalex.org/W1541438895","https://openalex.org/W2082273344","https://openalex.org/W2113292309","https://openalex.org/W2089894925","https://openalex.org/W3118553797","https://openalex.org/W2725940624","https://openalex.org/W2955374454","https://openalex.org/W2993421093","https://openalex.org/W2258092459"],"abstract_inverted_index":{"The":[0,56,104],"longest":[1,48,57,97,105],"path":[2,63,120],"and":[3,34,125],"Hamiltonian":[4],"problems":[5],"were":[6],"known":[7],"to":[8,66,94,115],"be":[9,113],"NP-complete.":[10],"In":[11,38],"spite":[12],"of":[13,16,27,46,72,100,108,121],"many":[14,25],"applications":[15],"these":[17],"problems,":[18],"their":[19],"complexities":[20],"are":[21],"still":[22],"unknown":[23],"for":[24],"classes":[26],"graphs,":[28],"including":[29],"supergrid":[30,36,54,77,82,102,110],"graphs":[31,111],"with":[32,68,84],"holes":[33],"solid":[35],"graphs.":[37,55,103],"this":[39],"paper,":[40],"we":[41],"will":[42,89],"study":[43],"the":[44,47,69,96,117],"complexity":[45],"(s,":[49,58,98,106],"t)-path":[50,59,99],"problem":[51],"on":[52],"O-shaped":[53,76,101,109],"is":[60,79,132],"a":[61,80,91,129],"simple":[62],"from":[64],"s":[65],"t":[67],"largest":[70],"number":[71],"visited":[73],"vertices.":[74],"An":[75],"graph":[78,83],"rectangular":[81,86],"one":[85],"hollow.":[87],"We":[88],"propose":[90],"linear-time":[92],"algorithm":[93],"find":[95],"t)-paths":[107],"can":[112],"used":[114],"compute":[116],"smallest":[118],"stitching":[119],"computerized":[122],"embroidery":[123],"machine":[124],"3D":[126],"printer":[127],"when":[128],"hollow":[130],"object":[131],"printed.":[133]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}