{"id":"https://openalex.org/W2158107054","doi":"https://doi.org/10.1142/s021819590000005x","title":"ALTERNATING HAMILTON CYCLES WITH MINIMUM NUMBER OF CROSSINGS IN THE PLANE","display_name":"ALTERNATING HAMILTON CYCLES WITH MINIMUM NUMBER OF CROSSINGS IN THE PLANE","publication_year":2000,"publication_date":"2000-02-01","ids":{"openalex":"https://openalex.org/W2158107054","doi":"https://doi.org/10.1142/s021819590000005x","mag":"2158107054"},"language":"en","primary_location":{"id":"doi:10.1142/s021819590000005x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s021819590000005x","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"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":"International Journal of Computational Geometry & 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/A5026355605","display_name":"Atsushi Kaneko","orcid":"https://orcid.org/0000-0003-4392-912X"},"institutions":[{"id":"https://openalex.org/I116465919","display_name":"Kogakuin University","ror":"https://ror.org/01wc2tq75","country_code":"JP","type":"education","lineage":["https://openalex.org/I116465919"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"ATSUSHI KANEKO","raw_affiliation_strings":["Department of Computer Science and Communication Engineering, Kogakuin University, Shinjuku-ku, Tokyo 163-8677, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Communication Engineering, Kogakuin University, Shinjuku-ku, Tokyo 163-8677, Japan","institution_ids":["https://openalex.org/I116465919"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062422841","display_name":"Mikio Kan\u014d","orcid":"https://orcid.org/0000-0002-7545-0327"},"institutions":[{"id":"https://openalex.org/I6178835","display_name":"Ibaraki University","ror":"https://ror.org/00sjd5653","country_code":"JP","type":"education","lineage":["https://openalex.org/I6178835"]},{"id":"https://openalex.org/I65143321","display_name":"Hitachi (Japan)","ror":"https://ror.org/02exqgm79","country_code":"JP","type":"company","lineage":["https://openalex.org/I65143321"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"M. KANO","raw_affiliation_strings":["Department of Computer and Information Sciences, Ibaraki University, Hitachi 316-8511, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Sciences, Ibaraki University, Hitachi 316-8511, Japan","institution_ids":["https://openalex.org/I6178835","https://openalex.org/I65143321"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080322469","display_name":"Kiyoshi Yoshimoto","orcid":"https://orcid.org/0000-0002-1142-375X"},"institutions":[{"id":"https://openalex.org/I104946051","display_name":"Nihon University","ror":"https://ror.org/05jk51a88","country_code":"JP","type":"education","lineage":["https://openalex.org/I104946051"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"KIYOSHI YOSHIMOTO","raw_affiliation_strings":["Department of Mathematics, Nihon Univeristy, Tokyo, 101-8308, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Nihon Univeristy, Tokyo, 101-8308, Japan","institution_ids":["https://openalex.org/I104946051"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7821,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.78858195,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"10","issue":"01","first_page":"73","last_page":"78"},"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.9979000091552734,"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.9979000091552734,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9722999930381775,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.9251000285148621,"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/mathematics","display_name":"Mathematics","score":0.8412572741508484},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8066802024841309},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.7439723014831543},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.6833891272544861},{"id":"https://openalex.org/keywords/crossing-number","display_name":"Crossing number (knot theory)","score":0.5992693901062012},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.5985913276672363},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5190966129302979},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.4971809685230255},{"id":"https://openalex.org/keywords/line-segment","display_name":"Line segment","score":0.4490887224674225},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.3609902560710907},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.32109129428863525},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.22906333208084106},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.04528537392616272}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8412572741508484},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8066802024841309},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7439723014831543},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.6833891272544861},{"id":"https://openalex.org/C2777724877","wikidata":"https://www.wikidata.org/wiki/Q2548661","display_name":"Crossing number (knot theory)","level":3,"score":0.5992693901062012},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.5985913276672363},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5190966129302979},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.4971809685230255},{"id":"https://openalex.org/C182124507","wikidata":"https://www.wikidata.org/wiki/Q166154","display_name":"Line segment","level":2,"score":0.4490887224674225},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.3609902560710907},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32109129428863525},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.22906333208084106},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.04528537392616272},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s021819590000005x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s021819590000005x","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"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":"International Journal of Computational Geometry & Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":2,"referenced_works":["https://openalex.org/W2019192303","https://openalex.org/W2030563429"],"related_works":["https://openalex.org/W1998402272","https://openalex.org/W2060058676","https://openalex.org/W2075509416","https://openalex.org/W1519914687","https://openalex.org/W2968422778","https://openalex.org/W2140952994","https://openalex.org/W2030977592","https://openalex.org/W1179244155","https://openalex.org/W2158107054","https://openalex.org/W2359803299"],"abstract_inverted_index":{"Let":[0],"X":[1,21,48],"and":[2,16,49,58],"Y":[3,23],"be":[4],"two":[5],"disjoint":[6],"sets":[7],"of":[8,20,47,51],"points":[9,19,46],"in":[10,39],"the":[11,26,40,89],"plane":[12,41],"such":[13,77],"that":[14,88],"|X|=|Y|":[15],"no":[17],"three":[18],"\u222a":[22],"are":[24,55],"on":[25,37,94],"same":[27],"line.":[28],"Then":[29],"we":[30,86],"can":[31],"draw":[32],"an":[33,68,78],"alternating":[34,79],"Hamilton":[35,80],"cycle":[36],"X\u222aY":[38],"which":[42,59],"passes":[43],"through":[44],"alternately":[45],"those":[50],"Y,":[52],"whose":[53],"edges":[54],"straight-line":[56],"segments,":[57],"contains":[60],"at":[61],"most":[62],"|X|-1":[63,93],"crossings.":[64],"Our":[65],"proof":[66],"gives":[67],"O(n":[69],"2":[70],"log":[71],"n)":[72],"time":[73],"algorithm":[74],"for":[75,100],"finding":[76],"cycle,":[81],"where":[82],"n":[83],"=|X|.":[84],"Moreover":[85],"show":[87],"above":[90],"upper":[91],"bound":[92],"crossing":[95],"number":[96],"is":[97],"best":[98],"possible":[99],"some":[101],"configurations.":[102]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}