{"id":"W2120741525","doi":"10.1007/s10586-006-9746-3","title":"Finding Hamiltonian paths in tournaments on clusters","year":2006,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Scalability; Tournament; Computation; Parallel computing; Computer cluster; Cluster (spacecraft); Parallel algorithm; Graph; Running time; Hamiltonian (control theory); Reuse; Theoretical computer science; Algorithm; Distributed computing; Combinatorics; Mathematical optimization; Mathematics; Operating system","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001120478,0.0006708024,0.001546349,0.001517163,0.002313309,0.003767484,0.002261277,0.001515257,0.007971914],"category_scores_gemma":[0.01006383,0.0009849637,0.0009245987,0.002634064,0.001802373,0.00336333,0.002000524,0.001459454,0.0004085473],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001581033,"about_ca_system_score_gemma":0.001240045,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006128875,"about_ca_topic_score_gemma":0.00865258,"domain_scores_codex":[0.9988331,0.0003822391,0.00005857959,0.0002800062,0.0001763648,0.0002696666],"domain_scores_gemma":[0.9913363,0.006152649,0.0007496109,0.000450709,0.0003691729,0.0009414643],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001430135,0.0006557061,0.01343181,0.0008226358,0.0003686508,0.0005761113,0.001398256,0.6006111,0.005681261,0.2705435,0.01761052,0.08687039],"study_design_scores_gemma":[0.0001941343,0.0001237637,0.001593769,0.00003711053,0.00006153426,0.000131322,0.0005597976,0.6454397,0.001068973,0.3485557,0.002203831,0.00003039457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.758136,0.0006945514,0.2240854,0.001437532,0.0001038932,0.0002943719,0.0006873738,0.0005316618,0.01402914],"genre_scores_gemma":[0.8998905,0.0003015202,0.09177774,0.0001610187,0.00006991823,0.0001217623,0.0007684679,0.0001510791,0.006757992],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007971914,"threshold_uncertainty_score":0.02666873,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01880286002196621,"score_gpt":0.253541145276148,"score_spread":0.2347382852541817,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}