{"id":"https://openalex.org/W2995864758","doi":"https://doi.org/10.1142/s0219265919500087","title":"Traversal with Enumeration of Geometric Graphs in Bounded Space","display_name":"Traversal with Enumeration of Geometric Graphs in Bounded Space","publication_year":2019,"publication_date":"2019-12-01","ids":{"openalex":"https://openalex.org/W2995864758","doi":"https://doi.org/10.1142/s0219265919500087","mag":"2995864758"},"language":"en","primary_location":{"id":"doi:10.1142/s0219265919500087","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0219265919500087","pdf_url":null,"source":{"id":"https://openalex.org/S63112013","display_name":"Journal of Interconnection Networks","issn_l":"0219-2659","issn":["0219-2659","1793-6713"],"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":"Journal of Interconnection Networks","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1811.04336","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"SAHAND KHAKABIMAMAGHANI","orcid":null},"institutions":[{"id":"https://openalex.org/I18014758","display_name":"Simon Fraser University","ror":"https://ror.org/0213rcc28","country_code":"CA","type":"education","lineage":["https://openalex.org/I18014758"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"SAHAND KHAKABIMAMAGHANI","raw_affiliation_strings":["Department of Computer Science, Simon Fraser University, 8888 University Drive, Burnaby, BC V5A 1S6, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Simon Fraser University, 8888 University Drive, Burnaby, BC V5A 1S6, Canada","institution_ids":["https://openalex.org/I18014758"]}]},{"author_position":"middle","author":{"id":null,"display_name":"MASOOD MASJOODY","orcid":null},"institutions":[{"id":"https://openalex.org/I18014758","display_name":"Simon Fraser University","ror":"https://ror.org/0213rcc28","country_code":"CA","type":"education","lineage":["https://openalex.org/I18014758"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"MASOOD MASJOODY","raw_affiliation_strings":["Department of Mathematics, Simon Fraser University, 8888 University Drive, Burnaby, BC V5A 1S6, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Simon Fraser University, 8888 University Drive, Burnaby, BC V5A 1S6, Canada","institution_ids":["https://openalex.org/I18014758"]}]},{"author_position":"last","author":{"id":null,"display_name":"LADISLAV STACHO","orcid":null},"institutions":[{"id":"https://openalex.org/I18014758","display_name":"Simon Fraser University","ror":"https://ror.org/0213rcc28","country_code":"CA","type":"education","lineage":["https://openalex.org/I18014758"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"LADISLAV STACHO","raw_affiliation_strings":["Department of Mathematics, Simon Fraser University, 8888 University Drive, Burnaby, BC V5A 1S6, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Simon Fraser University, 8888 University Drive, Burnaby, BC V5A 1S6, Canada","institution_ids":["https://openalex.org/I18014758"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I18014758"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.25320571,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"19","issue":"04","first_page":"1950008","last_page":"1950008"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9430999755859375,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9430999755859375,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.006800000090152025,"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/T11106","display_name":"Data Management and Algorithms","score":0.005799999926239252,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/geometric-graph-theory","display_name":"Geometric graph theory","score":0.7511000037193298},{"id":"https://openalex.org/keywords/graph-traversal","display_name":"Graph traversal","score":0.6782000064849854},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.5236999988555908},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5232999920845032},{"id":"https://openalex.org/keywords/spatial-network","display_name":"Spatial network","score":0.45669999718666077},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4507000148296356},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4262000024318695},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.40529999136924744},{"id":"https://openalex.org/keywords/path-graph","display_name":"Path graph","score":0.39070001244544983},{"id":"https://openalex.org/keywords/edge-graceful-labeling","display_name":"Edge-graceful labeling","score":0.3571999967098236}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7681999802589417},{"id":"https://openalex.org/C173547177","wikidata":"https://www.wikidata.org/wiki/Q1503271","display_name":"Geometric graph theory","level":5,"score":0.7511000037193298},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.6782000064849854},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5582000017166138},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.5236999988555908},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5232999920845032},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.462799996137619},{"id":"https://openalex.org/C53471067","wikidata":"https://www.wikidata.org/wiki/Q7574076","display_name":"Spatial network","level":2,"score":0.45669999718666077},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4507000148296356},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4262000024318695},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.40529999136924744},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.39070001244544983},{"id":"https://openalex.org/C150433608","wikidata":"https://www.wikidata.org/wiki/Q5337633","display_name":"Edge-graceful labeling","level":5,"score":0.3571999967098236},{"id":"https://openalex.org/C148364342","wikidata":"https://www.wikidata.org/wiki/Q948887","display_name":"Wheel graph","level":5,"score":0.35179999470710754},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.3497999906539917},{"id":"https://openalex.org/C166513658","wikidata":"https://www.wikidata.org/wiki/Q5597093","display_name":"Graph labeling","level":5,"score":0.32989999651908875},{"id":"https://openalex.org/C49777392","wikidata":"https://www.wikidata.org/wiki/Q5535495","display_name":"Geometric networks","level":3,"score":0.3248000144958496},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.31450000405311584},{"id":"https://openalex.org/C14201764","wikidata":"https://www.wikidata.org/wiki/Q1205074","display_name":"Symmetric graph","level":5,"score":0.30550000071525574},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.2935999929904938},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.29120001196861267},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.2906000018119812},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.2903999984264374},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.2883000075817108},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.28380000591278076},{"id":"https://openalex.org/C103257674","wikidata":"https://www.wikidata.org/wiki/Q6934937","display_name":"Multiple edges","level":3,"score":0.2667999863624573},{"id":"https://openalex.org/C30609935","wikidata":"https://www.wikidata.org/wiki/Q7291969","display_name":"Random geometric graph","level":5,"score":0.26260000467300415},{"id":"https://openalex.org/C45725084","wikidata":"https://www.wikidata.org/wiki/Q4390447","display_name":"Biconnected graph","level":5,"score":0.2603999972343445},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.2572999894618988},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2542000114917755},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.2522999942302704},{"id":"https://openalex.org/C168291704","wikidata":"https://www.wikidata.org/wiki/Q902252","display_name":"Complement graph","level":5,"score":0.251800000667572},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.25029999017715454},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.25029999017715454}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0219265919500087","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0219265919500087","pdf_url":null,"source":{"id":"https://openalex.org/S63112013","display_name":"Journal of Interconnection Networks","issn_l":"0219-2659","issn":["0219-2659","1793-6713"],"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":"Journal of Interconnection Networks","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1811.04336","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1811.04336","pdf_url":"https://arxiv.org/pdf/1811.04336","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1811.04336","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1811.04336","pdf_url":"https://arxiv.org/pdf/1811.04336","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1488557728","https://openalex.org/W2027188157","https://openalex.org/W2104800005","https://openalex.org/W2137815559","https://openalex.org/W2138394562","https://openalex.org/W2611754984"],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,26,72],"provide":[4],"an":[5,74],"algorithm":[6,56,75],"for":[7,76],"traversing":[8],"geometric":[9,30,106],"graphs":[10],"which":[11,57],"visits":[12],"all":[13],"vertices":[14,69,122],"and":[15,19,70,132],"reports":[16],"every":[17],"vertex":[18,83],"edge":[20],"exactly":[21],"once.":[22],"To":[23,63],"achieve":[24],"this,":[25],"combine":[27],"a":[28,39,43,54,82,85,105],"given":[29],"graph":[31,49,86,107,116],"G":[32,124],"with":[33,67],"the":[34,46,65,90,102,114],"integer":[35],"lattice,":[36],"seen":[37],"as":[38],"graph,":[40],"in":[41,84,89],"such":[42],"way":[44],"that":[45],"resulting":[47],"hypothetical":[48,68],"can":[50],"be":[51],"traversed":[52],"using":[53,92],"known":[55],"is":[58,128],"based":[59],"on":[60,113],"face":[61],"routing.":[62],"overcome":[64],"problem":[66],"edges,":[71],"develop":[73],"visiting":[77],"any":[78],"k-th":[79],"neighborhood":[80],"of":[81,104,120,123],"straight-line":[87],"drawn":[88],"plane":[91],"O(k":[93],"log":[94],"k)":[95],"memory.":[96],"The":[97],"memory":[98],"needed":[99],"to":[100,111],"complete":[101],"traversal":[103],"then":[108],"turns":[109],"out":[110],"depend":[112],"maximum":[115],"distance":[117,127],"among":[118],"pairs":[119],"distinct":[121],"whose":[125],"Euclidean":[126],"greater":[129],"than":[130,134],"one":[131],"less":[133],"[Formula:":[135],"see":[136],"text].":[137]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2019-12-26T00:00:00"}