{"id":"W2024656522","doi":"10.1007/s00453-012-9624-8","title":"3-Colouring AT-Free Graphs in Polynomial Time","year":2012,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chordal graph; Indifference graph; Pathwidth; Interval graph; Combinatorics; Time complexity; Mathematics; Maximal independent set; Cograph; Theory of computation; Discrete mathematics; Split graph; Strong perfect graph theorem; Modular decomposition; Graph; Computer science; 1-planar graph; Line graph; Algorithm","routes":{"ca_aff":true,"ca_fund":true,"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.001445611,0.00241565,0.002444366,0.00144841,0.002760984,0.00547088,0.003825897,0.002785271,0.03406283],"category_scores_gemma":[0.007956152,0.001515056,0.004053793,0.003169037,0.002756407,0.01019653,0.00550622,0.004551639,0.006431956],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003423259,"about_ca_system_score_gemma":0.003422071,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006219235,"about_ca_topic_score_gemma":0.01387038,"domain_scores_codex":[0.9974592,0.0004681954,0.0001424814,0.0005910225,0.000543818,0.0007953275],"domain_scores_gemma":[0.9889295,0.007025012,0.0006341239,0.002076866,0.0005269455,0.0008075421],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00367515,0.002017708,0.009107063,0.003017862,0.0007631553,0.00111131,0.002751384,0.1920475,0.05857806,0.3027697,0.08138828,0.3427729],"study_design_scores_gemma":[0.0007559466,0.0002281286,0.002036908,0.0001165239,0.0005047666,0.000579333,0.0007021946,0.1811216,0.01805968,0.7789518,0.01686009,0.00008294744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4670883,0.000974828,0.4321142,0.00713708,0.0006138701,0.001353845,0.005665164,0.009675722,0.07537707],"genre_scores_gemma":[0.6082127,0.0008005821,0.3407863,0.001502055,0.0002866885,0.0007581093,0.007455922,0.002833923,0.03736355],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03406283,"threshold_uncertainty_score":0.1139515,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01229900869453198,"score_gpt":0.2583412557159052,"score_spread":0.2460422470213732,"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."}}