{"id":"https://openalex.org/W4417307738","doi":"https://doi.org/10.2197/ipsjjip.33.1020","title":"Number of Crossings in Hamiltonian Cycles on Given <i>n</i> Points","display_name":"Number of Crossings in Hamiltonian Cycles on Given <i>n</i> Points","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4417307738","doi":"https://doi.org/10.2197/ipsjjip.33.1020"},"language":"en","primary_location":{"id":"doi:10.2197/ipsjjip.33.1020","is_oa":true,"landing_page_url":"https://doi.org/10.2197/ipsjjip.33.1020","pdf_url":"https://www.jstage.jst.go.jp/article/ipsjjip/33/0/33_1020/_pdf","source":{"id":"https://openalex.org/S4210239267","display_name":"Journal of Information Processing","issn_l":"1882-6652","issn":["1882-6652"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Information Processing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.jstage.jst.go.jp/article/ipsjjip/33/0/33_1020/_pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102009458","display_name":"Toshinori Sakai","orcid":null},"institutions":[{"id":"https://openalex.org/I1314466530","display_name":"Tokai University","ror":"https://ror.org/01p7qe739","country_code":"JP","type":"education","lineage":["https://openalex.org/I1314466530"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Toshinori Sakai","raw_affiliation_strings":["Tokai University"],"affiliations":[{"raw_affiliation_string":"Tokai University","institution_ids":["https://openalex.org/I1314466530"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5102009458"],"corresponding_institution_ids":["https://openalex.org/I1314466530"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.60811594,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"33","issue":"0","first_page":"1020","last_page":"1024"},"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.9714999794960022,"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.9714999794960022,"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/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.003000000026077032,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.002899999963119626,"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.7396000027656555},{"id":"https://openalex.org/keywords/hamiltonian","display_name":"Hamiltonian (control theory)","score":0.707099974155426},{"id":"https://openalex.org/keywords/general-position","display_name":"General position","score":0.6626999974250793},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5909000039100647},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5253000259399414},{"id":"https://openalex.org/keywords/hamiltonian-path-problem","display_name":"Hamiltonian path problem","score":0.3937000036239624},{"id":"https://openalex.org/keywords/crossing-number","display_name":"Crossing number (knot theory)","score":0.367000013589859}],"concepts":[{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.7396000027656555},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.707099974155426},{"id":"https://openalex.org/C150397156","wikidata":"https://www.wikidata.org/wiki/Q591310","display_name":"General position","level":2,"score":0.6626999974250793},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6004999876022339},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5909000039100647},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5615000128746033},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5253000259399414},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4075999855995178},{"id":"https://openalex.org/C104737047","wikidata":"https://www.wikidata.org/wiki/Q987652","display_name":"Hamiltonian path problem","level":4,"score":0.3937000036239624},{"id":"https://openalex.org/C2777724877","wikidata":"https://www.wikidata.org/wiki/Q2548661","display_name":"Crossing number (knot theory)","level":3,"score":0.367000013589859},{"id":"https://openalex.org/C199692417","wikidata":"https://www.wikidata.org/wiki/Q7269362","display_name":"Quartic graph","level":5,"score":0.3190000057220459},{"id":"https://openalex.org/C121770821","wikidata":"https://www.wikidata.org/wiki/Q2072471","display_name":"Hamiltonian system","level":2,"score":0.3077000081539154},{"id":"https://openalex.org/C137618395","wikidata":"https://www.wikidata.org/wiki/Q576728","display_name":"Winding number","level":2,"score":0.3066999912261963},{"id":"https://openalex.org/C125080357","wikidata":"https://www.wikidata.org/wiki/Q45715","display_name":"Complete graph","level":3,"score":0.304500013589859},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2809000015258789},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2727000117301941},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.2687999904155731},{"id":"https://openalex.org/C94020503","wikidata":"https://www.wikidata.org/wiki/Q12916","display_name":"Real number","level":2,"score":0.26429998874664307},{"id":"https://openalex.org/C198082294","wikidata":"https://www.wikidata.org/wiki/Q3399648","display_name":"Position (finance)","level":2,"score":0.26249998807907104},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.2531000077724457}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.2197/ipsjjip.33.1020","is_oa":true,"landing_page_url":"https://doi.org/10.2197/ipsjjip.33.1020","pdf_url":"https://www.jstage.jst.go.jp/article/ipsjjip/33/0/33_1020/_pdf","source":{"id":"https://openalex.org/S4210239267","display_name":"Journal of Information Processing","issn_l":"1882-6652","issn":["1882-6652"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Information Processing","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.2197/ipsjjip.33.1020","is_oa":true,"landing_page_url":"https://doi.org/10.2197/ipsjjip.33.1020","pdf_url":"https://www.jstage.jst.go.jp/article/ipsjjip/33/0/33_1020/_pdf","source":{"id":"https://openalex.org/S4210239267","display_name":"Journal of Information Processing","issn_l":"1882-6652","issn":["1882-6652"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Information Processing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4417307738.pdf"},"referenced_works_count":7,"referenced_works":["https://openalex.org/W149069588","https://openalex.org/W2069888750","https://openalex.org/W2109042433","https://openalex.org/W2115400757","https://openalex.org/W2124128624","https://openalex.org/W2247541104","https://openalex.org/W4391188057"],"related_works":[],"abstract_inverted_index":{"Let":[0],"P":[1,28],"be":[2],"a":[3,42,55],"set":[4],"of":[5,19,21,61,65,67,81,85,91],"n":[6],"points":[7],"in":[8,23,59,69],"general":[9],"position":[10],"on":[11,27,74,102],"the":[12,16,62,70,82],"plane.":[13],"We":[14,76],"consider":[15],"maximum":[17,83],"number":[18,63,90],"crossings":[20,66,96],"edges":[22,68],"geometric":[24],"Hamiltonian":[25,43,100],"cycles":[26,101],"with":[29,45],"straight-line":[30],"edges.":[31],"\u00c1lvarez-Rebollar":[32],"et":[33],"al.":[34],"proved":[35],"that":[36],"for":[37,97],"any":[38],"P,":[39],"there":[40],"is":[41],"cycle":[44],"at":[46],"least":[47],"n2/12-O(n)":[48],"crossings.":[49],"In":[50],"this":[51],"paper,":[52],"we":[53],"give":[54,78],"lower":[56,79],"bound":[57],"4crP(Kn)/(n-1)(n-2)":[58],"terms":[60],"crP(Kn)":[64],"complete":[71],"graph":[72],"Kn":[73],"P.":[75,103],"also":[77],"bounds":[80],"numbers":[84],"mutual":[86,95],"crossings,":[87],"and":[88,94],"total":[89],"both":[92],"self-crossings":[93],"k":[98],"edge-disjoint":[99]},"counts_by_year":[],"updated_date":"2026-03-11T06:11:40.159057","created_date":"2025-12-14T00:00:00"}