{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002618508,0.000938979,0.0009582252,0.0009708678,0.0009704303,0.0008696848,0.001965618,0.0009423366,0.004581391],"category_scores_gemma":[0.009860748,0.0003987608,0.0005419561,0.003482087,0.001020773,0.001861013,0.001261341,0.001284457,0.0006151722],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001177921,"about_ca_system_score_gemma":0.001041672,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005756408,"about_ca_topic_score_gemma":0.002409152,"domain_scores_codex":[0.9974046,0.001025771,0.0001838175,0.0004121614,0.0006640003,0.0003095783],"domain_scores_gemma":[0.9883553,0.007455688,0.0004239806,0.002315757,0.001057531,0.0003916888],"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.003346687,0.00251566,0.003541107,0.0006672934,0.000188243,0.0002710802,0.0004338291,0.819559,0.009603524,0.01880819,0.01323416,0.1278313],"study_design_scores_gemma":[0.0006218932,0.0004790687,0.001047048,0.00001837914,0.00003504893,0.00006688482,0.0001504076,0.9740134,0.008956531,0.01170588,0.00288402,0.00002129542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9031242,0.001097518,0.06720021,0.0006563131,0.0001784257,0.0004320344,0.001442632,0.004963721,0.02090504],"genre_scores_gemma":[0.9082956,0.0004492544,0.08778019,0.00008335298,0.00003572247,0.0002487027,0.001290395,0.0002770704,0.001539615],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005756408,"threshold_uncertainty_score":0.01532626,"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."}}