{"id":"W3006001508","doi":"10.1142/s179383092150049x","title":"Semi-dynamic algorithms for strongly chordal graphs","year":2020,"lang":"en","type":"preprint","venue":"Discrete Mathematics Algorithms and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Windsor","funders":"","keywords":"Chordal graph; Interval graph; Combinatorics; Enhanced Data Rates for GSM Evolution; Dynamic problem; Shortest path problem; Mathematics; Pathwidth; Graph; Computer science; Treewidth; Algorithm; Discrete mathematics; Line graph; 1-planar graph","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004640619,0.0005254957,0.000642759,0.0002310942,0.0004394673,0.0005831787,0.002044693,0.0002585558,0.000006264831],"category_scores_gemma":[0.00006179031,0.00050187,0.0003044945,0.0005296911,0.0002533065,0.0002116928,0.002056587,0.0007178838,0.00001887533],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000607911,"about_ca_system_score_gemma":0.0001500509,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006574005,"about_ca_topic_score_gemma":0.000003152864,"domain_scores_codex":[0.9968832,0.00004582119,0.0006487759,0.001309072,0.0005122508,0.0006008691],"domain_scores_gemma":[0.9969756,0.0004054121,0.0003834075,0.001591597,0.0002686926,0.0003753067],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004254602,0.0001461393,0.000003462847,0.0007891359,0.0001651257,0.000002701128,0.0008603835,0.0005046601,0.0002579777,0.9368783,0.0001700583,0.06021785],"study_design_scores_gemma":[0.0002097214,0.00004259488,0.000012208,0.00004787492,0.00003408545,0.000006545038,0.0001269721,0.4697146,0.00008557456,0.5269045,0.002477861,0.0003375483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001580919,0.0006642891,0.9925875,0.001592875,0.0001094843,0.003206408,0.0008190708,0.0003357889,0.000526487],"genre_scores_gemma":[0.008769057,0.0004365107,0.9838546,0.00007989123,0.0001881255,0.005875397,0.0003848057,0.0001005654,0.0003110753],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4692099,"threshold_uncertainty_score":0.9997433,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03345199863854946,"score_gpt":0.332869464926785,"score_spread":0.2994174662882356,"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."}}