{"id":"https://openalex.org/W2013772871","doi":"https://doi.org/10.1007/bf02523239","title":"Parallel algorithms for the hamiltonian cycle and hamiltonian path problems in semicomplete bipartite digraphs","display_name":"Parallel algorithms for the hamiltonian cycle and hamiltonian path problems in semicomplete bipartite digraphs","publication_year":1997,"publication_date":"1997-01-01","ids":{"openalex":"https://openalex.org/W2013772871","doi":"https://doi.org/10.1007/bf02523239","mag":"2013772871"},"language":"en","primary_location":{"id":"doi:10.1007/bf02523239","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02523239","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","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/A5037418562","display_name":"J\u00f8rgen Bang\u2010Jensen","orcid":"https://orcid.org/0000-0001-5783-7125"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"J. Bang-Jensen","raw_affiliation_strings":["Department of Mathematics and Computer Science, Odense University, DK 5230, Odense M, Denmark","Department of Mathematics and Computer Science, Odense University, Odense M, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Odense University, DK 5230, Odense M, Denmark","institution_ids":[]},{"raw_affiliation_string":"Department of Mathematics and Computer Science, Odense University, Odense M, Denmark","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056964260","display_name":"Mohammed Haddad","orcid":"https://orcid.org/0000-0002-8699-7520"},"institutions":[{"id":"https://openalex.org/I102197404","display_name":"Universit\u00e9 Paris-Sud","ror":"https://ror.org/028rypz17","country_code":"FR","type":"education","lineage":["https://openalex.org/I102197404"]},{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]},{"id":"https://openalex.org/I4210144804","display_name":"Laboratoire de Recherche en Informatique","ror":"https://ror.org/04e3ktk27","country_code":"FR","type":"facility","lineage":["https://openalex.org/I102197404","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I4210144804","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"M. El Haddad","raw_affiliation_strings":["Universit\u00e9 de Paris-Sud Orsay, LRI b\u00e2t 490, 91405, Orsay Cedex, France","Universit\u00e9 de Paris-Sud (Orsay), Orsay Cedex, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Paris-Sud Orsay, LRI b\u00e2t 490, 91405, Orsay Cedex, France","institution_ids":["https://openalex.org/I102197404","https://openalex.org/I204730241","https://openalex.org/I4210144804"]},{"raw_affiliation_string":"Universit\u00e9 de Paris-Sud (Orsay), Orsay Cedex, France","institution_ids":["https://openalex.org/I102197404","https://openalex.org/I204730241"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111739071","display_name":"Yannis Manoussakis","orcid":null},"institutions":[{"id":"https://openalex.org/I102197404","display_name":"Universit\u00e9 Paris-Sud","ror":"https://ror.org/028rypz17","country_code":"FR","type":"education","lineage":["https://openalex.org/I102197404"]},{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]},{"id":"https://openalex.org/I4210144804","display_name":"Laboratoire de Recherche en Informatique","ror":"https://ror.org/04e3ktk27","country_code":"FR","type":"facility","lineage":["https://openalex.org/I102197404","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I4210144804","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Y. Manoussakis","raw_affiliation_strings":["Universit\u00e9 de Paris-Sud Orsay, LRI b\u00e2t 490, 91405, Orsay Cedex, France","Universit\u00e9 de Paris-Sud Orsay, Orsay Cedex, France","Universit\u00e9 de Paris-Sud (Orsay), Orsay Cedex, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Paris-Sud Orsay, LRI b\u00e2t 490, 91405, Orsay Cedex, France","institution_ids":["https://openalex.org/I102197404","https://openalex.org/I204730241","https://openalex.org/I4210144804"]},{"raw_affiliation_string":"Universit\u00e9 de Paris-Sud Orsay, Orsay Cedex, France","institution_ids":["https://openalex.org/I102197404"]},{"raw_affiliation_string":"Universit\u00e9 de Paris-Sud (Orsay), Orsay Cedex, France","institution_ids":["https://openalex.org/I102197404","https://openalex.org/I204730241"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089548776","display_name":"Teresa M. Przytycka","orcid":"https://orcid.org/0000-0002-6261-277X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"T. M. Przytycka","raw_affiliation_strings":["Department of Mathematics and Computer Science, Odense University, DK 5230, Odense M, Denmark","Department of Mathematics and Computer Science, Odense University, Odense M, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Odense University, DK 5230, Odense M, Denmark","institution_ids":[]},{"raw_affiliation_string":"Department of Mathematics and Computer Science, Odense University, Odense M, Denmark","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.0365,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.75385592,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"17","issue":"1","first_page":"67","last_page":"87"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9987000226974487,"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/bipartite-graph","display_name":"Bipartite graph","score":0.899554431438446},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.8487235307693481},{"id":"https://openalex.org/keywords/hamiltonian-path-problem","display_name":"Hamiltonian path problem","score":0.762014627456665},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7561690807342529},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7289938926696777},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.6502970457077026},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.500058650970459},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.47662484645843506},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4696832001209259},{"id":"https://openalex.org/keywords/hamiltonian","display_name":"Hamiltonian (control theory)","score":0.43824371695518494},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39172857999801636},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2968035042285919}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.899554431438446},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.8487235307693481},{"id":"https://openalex.org/C104737047","wikidata":"https://www.wikidata.org/wiki/Q987652","display_name":"Hamiltonian path problem","level":4,"score":0.762014627456665},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7561690807342529},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7289938926696777},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.6502970457077026},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.500058650970459},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.47662484645843506},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4696832001209259},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.43824371695518494},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39172857999801636},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2968035042285919},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/bf02523239","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02523239","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:sdu.dk:openaire_cris_publications/b7d8670d-2a03-47d7-a4c0-0e598321a0c4","is_oa":false,"landing_page_url":"https://portal.findresearcher.sdu.dk/da/publications/b7d8670d-2a03-47d7-a4c0-0e598321a0c4","pdf_url":null,"source":{"id":"https://openalex.org/S4306400423","display_name":"University of Southern Denmark Research Portal (University of Southern Denmark)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177969490","host_organization_name":"University of Southern Denmark","host_organization_lineage":["https://openalex.org/I177969490"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bang-Jensen, J, Przytycka, T, Manoussakis, Y & El Haddad, M 1997, 'Parallel algorithms for the hamiltonian cycle and hamiltonian path problems in semicomplete bipartite digraphs', Algorithmica, vol. 17, pp. 67-87. https://doi.org/10.1007/BF02523239","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.30.6136","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.30.6136","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cherubino.med.jhmi.edu/~przytyck/ham.ps.Z","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1484040084","https://openalex.org/W1495591881","https://openalex.org/W1586466644","https://openalex.org/W1965874601","https://openalex.org/W1978583881","https://openalex.org/W1981234161","https://openalex.org/W2006803815","https://openalex.org/W2013444956","https://openalex.org/W2024385930","https://openalex.org/W2033472258","https://openalex.org/W2037752639","https://openalex.org/W2048972466","https://openalex.org/W2050734073","https://openalex.org/W2073975876","https://openalex.org/W2080063509","https://openalex.org/W2130566259","https://openalex.org/W2132750992","https://openalex.org/W2143462372","https://openalex.org/W2156372444","https://openalex.org/W2395933225","https://openalex.org/W2470216483","https://openalex.org/W2610479830","https://openalex.org/W4210766026","https://openalex.org/W4239078418"],"related_works":["https://openalex.org/W99690574","https://openalex.org/W2790788195","https://openalex.org/W2121104987","https://openalex.org/W4293584096","https://openalex.org/W2389785861","https://openalex.org/W143702185","https://openalex.org/W4387272283","https://openalex.org/W1618127724","https://openalex.org/W4299647289","https://openalex.org/W2962785705"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-06-19T15:47:20.252518","created_date":"2025-10-10T00:00:00"}