{"id":"https://openalex.org/W2138166588","doi":"https://doi.org/10.1142/s0129054101000588","title":"AN ALGORITHM FOR FINDING LONGEST CYCLES IN CERTAIN BIPARTITE GRAPHS","display_name":"AN ALGORITHM FOR FINDING LONGEST CYCLES IN CERTAIN BIPARTITE GRAPHS","publication_year":2001,"publication_date":"2001-08-01","ids":{"openalex":"https://openalex.org/W2138166588","doi":"https://doi.org/10.1142/s0129054101000588","mag":"2138166588"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054101000588","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054101000588","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"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 Foundations of Computer Science","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/A5007553157","display_name":"Pak\u2010Ken Wong","orcid":null},"institutions":[{"id":"https://openalex.org/I12524447","display_name":"Seton Hall University","ror":"https://ror.org/007tn5k56","country_code":"US","type":"education","lineage":["https://openalex.org/I12524447"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"PAK-KEN WONG","raw_affiliation_strings":["Department of Mathematics and Computer Science, Seton Hall University, South Orange, N. J. 07079, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Seton Hall University, South Orange, N. J. 07079, USA","institution_ids":["https://openalex.org/I12524447"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5007553157"],"corresponding_institution_ids":["https://openalex.org/I12524447"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.22794152,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"12","issue":"04","first_page":"445","last_page":"454"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9995999932289124,"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.9995999932289124,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9990000128746033,"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/T11476","display_name":"Graph theory and applications","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.8441720008850098},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8018161058425903},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.6563634276390076},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6377689838409424},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.4566958546638489},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44011086225509644},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42704692482948303},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3527679443359375}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8441720008850098},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8018161058425903},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.6563634276390076},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6377689838409424},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.4566958546638489},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44011086225509644},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42704692482948303},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3527679443359375}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054101000588","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054101000588","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"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 Foundations of Computer Science","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":5,"referenced_works":["https://openalex.org/W1967911775","https://openalex.org/W1975951388","https://openalex.org/W1983755786","https://openalex.org/W2065748238","https://openalex.org/W2069133957"],"related_works":["https://openalex.org/W2091826982","https://openalex.org/W2036057584","https://openalex.org/W2107875203","https://openalex.org/W245205139","https://openalex.org/W2921162226","https://openalex.org/W4234658180","https://openalex.org/W4235849992","https://openalex.org/W4246000090","https://openalex.org/W2910933086","https://openalex.org/W4288630335"],"abstract_inverted_index":{"Let":[0],"G":[1,58],"be":[2],"a":[3,60,74,92,99],"connected":[4],"bipartite":[5],"graph":[6],"with":[7,8],"bipartition":[9],"(X,":[10],"Y)":[11],"such":[12,73],"that":[13,57],"|X|":[14],"\u2265":[15,51],"|Y|":[16,25],"(\u2265":[17],"2).":[18],"Put":[19],"n":[20,52],"=":[21,24,28,45,88],"|X|,":[22],"m":[23,29,87],"and":[26,40],"l":[27],"+":[30,49,53],"n.":[31],"Suppose":[32],"that,":[33],"for":[34],"all":[35],"vertices":[36],"x":[37],"\u2208":[38,42],"X":[39],"y":[41],"Y,":[43],"dist(x,y)":[44],"3":[46,83],"implies":[47],"d(x)":[48],"d(y)":[50],"1.":[54],"We":[55,65],"show":[56],"contains":[59],"cycle":[61,94],"of":[62,78,95],"length":[63],"2m.":[64],"also":[66],"give":[67],"an":[68],"efficient":[69],"algorithm":[70,80],"to":[71],"obtain":[72],"cycle.":[75],"The":[76],"complexity":[77],"this":[79],"is":[81],"O(l":[82],").":[84],"In":[85],"case":[86],"n,":[89],"we":[90],"find":[91],"hamiltonian":[93],"G.":[96],"This":[97],"generalizes":[98],"result":[100],"given":[101],"in":[102],"[10].":[103]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}