{"id":"W31481056","doi":"10.1186/s12913-019-4391-8","title":"Computing Minimal Triangulations in Time","year":2005,"lang":"en","type":"article","venue":"BMC Health Services Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Canadian Institutes of Health Research; Ministry of Health, British Columbia","keywords":"Combinatorics; Time complexity; Upper and lower bounds; Triangulation; Vertex (graph theory); Graph; Mathematics; Matrix multiplication; Discrete mathematics; Running time; Computer science; Algorithm","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001155664,0.0008991812,0.001393685,0.002356856,0.001202292,0.002699972,0.001929401,0.001059031,0.01808191],"category_scores_gemma":[0.01120639,0.0007251854,0.001682438,0.002313447,0.001224097,0.002854926,0.002887533,0.001428198,0.00284538],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001106004,"about_ca_system_score_gemma":0.001172998,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008175907,"about_ca_topic_score_gemma":0.0161487,"domain_scores_codex":[0.9985322,0.0002884445,0.0001307628,0.0003593706,0.0004152344,0.0002739428],"domain_scores_gemma":[0.9945485,0.003046824,0.0003928907,0.0007374454,0.0009735688,0.0003007196],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008939484,0.0001814202,0.01273511,0.00180746,0.0002729193,0.0007082419,0.002184247,0.3880281,0.008707441,0.1874564,0.03641926,0.3606054],"study_design_scores_gemma":[0.0001224746,0.0001458667,0.001996062,0.0001482989,0.00007024004,0.0002951167,0.001261217,0.5536446,0.003016949,0.4167267,0.02253029,0.00004220461],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1290906,0.0009090006,0.8466296,0.001192734,0.0002191111,0.0002495502,0.004259589,0.001748703,0.01570108],"genre_scores_gemma":[0.3193009,0.0005789065,0.6584349,0.0002101625,0.0001070898,0.0002791475,0.009499391,0.0008803444,0.01070917],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01808191,"threshold_uncertainty_score":0.06049001,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06898875246700287,"score_gpt":0.4477635898356352,"score_spread":0.3787748373686324,"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."}}