{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001645845,0.0007440016,0.0009275445,0.001113648,0.001107434,0.002680979,0.003018582,0.001203728,0.005214261],"category_scores_gemma":[0.0147486,0.000496252,0.0009661964,0.001805402,0.001441573,0.007222445,0.004625898,0.002269365,0.00141346],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001789073,"about_ca_system_score_gemma":0.001994294,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001491329,"about_ca_topic_score_gemma":0.002127461,"domain_scores_codex":[0.996865,0.0006424714,0.0002672623,0.0007993874,0.001093026,0.0003328906],"domain_scores_gemma":[0.9882352,0.005863367,0.0007419938,0.003504675,0.001251915,0.0004028605],"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.000576371,0.0003185575,0.001606512,0.000657442,0.00009404404,0.000194967,0.0004891683,0.1334008,0.01582907,0.5144165,0.01608884,0.3163278],"study_design_scores_gemma":[0.00009399191,0.0001124913,0.0002971481,0.00003524058,0.00002835584,0.000332116,0.0001534596,0.3528881,0.006026116,0.6252143,0.01478341,0.00003534687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02284162,0.0006317975,0.9663578,0.0007112181,0.00009878449,0.00023525,0.0003877137,0.001522189,0.007213614],"genre_scores_gemma":[0.4021989,0.0009543078,0.5862247,0.0006156438,0.0001930202,0.0004358751,0.001734954,0.0004628732,0.007179759],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005214261,"threshold_uncertainty_score":0.01744348,"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."}}