{"id":"W2105487310","doi":"10.1002/cpe.700","title":"Parallel computation on interval graphs: algorithms and experiments","year":2002,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Myrinet; Clique; Parallel computing; Interval (graph theory); Algorithm; Parallel algorithm; Interval graph; Interconnection; Computation; Graph; Implementation; Theoretical computer science; Mathematics; Chordal graph; Message passing; Combinatorics","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001851468,0.000216773,0.0001964246,0.0001352479,0.0004488424,0.0004382178,0.0002042451,0.00006088245,0.00001154852],"category_scores_gemma":[0.0001178808,0.0002131865,0.00003124753,0.0002911148,0.0002600634,0.001782221,0.0001992768,0.0001956031,0.00001075108],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001146125,"about_ca_system_score_gemma":0.000009869441,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002260351,"about_ca_topic_score_gemma":6.340219e-7,"domain_scores_codex":[0.9984252,0.0001453159,0.0003027947,0.0006081272,0.0002808154,0.0002377311],"domain_scores_gemma":[0.9988679,0.0005331197,0.0001723827,0.0001596344,0.000105702,0.0001612739],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002397296,0.0002442332,0.000196913,0.00002539514,0.00002672645,0.00002724398,0.03007214,0.000100471,0.00004912364,0.06956901,0.0004333836,0.8992314],"study_design_scores_gemma":[0.001513643,0.0008458076,0.00192742,0.0001111319,0.00001892144,0.0003109009,0.00452994,0.9634598,0.0001569338,0.01987075,0.006653933,0.0006007889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1487349,0.005485139,0.8402853,0.001988532,0.0008314738,0.0003189748,0.000003990982,0.0001960703,0.002155646],"genre_scores_gemma":[0.9501522,0.001243712,0.04745019,0.001038807,0.00003702796,0.00003842831,0.000004075331,0.000006865053,0.00002875015],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9633594,"threshold_uncertainty_score":0.8693494,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06738285749543127,"score_gpt":0.3417904445462184,"score_spread":0.2744075870507872,"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."}}