{"id":"W2253740506","doi":"","title":"A Simple Algorithm for the Graph Minor Decomposition -- Logic meets Structural Graph Theory","year":2013,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Graph minor; Tree decomposition; Discrete mathematics; Mathematical proof; Graph property; Clique-width; Minor (academic); Mathematics; Robertson–Seymour theorem; Graph theory; Treewidth; Tree-depth; Algorithm; Computer science; Line graph; Voltage graph; Combinatorics; Graph; Pathwidth","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.001025837,0.001349029,0.001087619,0.001728233,0.001286616,0.002563153,0.002950019,0.001581006,0.02238039],"category_scores_gemma":[0.00497949,0.0008293249,0.002316447,0.001792333,0.001534155,0.005646983,0.004643417,0.00271661,0.007113244],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001731453,"about_ca_system_score_gemma":0.002625647,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001927539,"about_ca_topic_score_gemma":0.003088298,"domain_scores_codex":[0.9981705,0.0002563466,0.0001421409,0.0005619013,0.0006032875,0.0002658119],"domain_scores_gemma":[0.9981633,0.0006794872,0.00008095104,0.0005972181,0.0003670221,0.0001121522],"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.0006333056,0.0004838335,0.001390375,0.0007507322,0.0001325939,0.0003705891,0.0007465626,0.01083664,0.03427684,0.2637752,0.03578163,0.6508219],"study_design_scores_gemma":[0.0004711792,0.0003151488,0.0009508283,0.0001292008,0.0001772892,0.0009909767,0.0005213688,0.1477867,0.0342782,0.7341021,0.08012522,0.0001517352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006392754,0.0001398309,0.9790709,0.0008635758,0.0001203479,0.0003279834,0.0003835689,0.006225566,0.006475544],"genre_scores_gemma":[0.07089548,0.0001528444,0.9210228,0.0003781641,0.00007374697,0.0003153373,0.001256812,0.001156694,0.004748041],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02238039,"threshold_uncertainty_score":0.07486981,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02035379765603434,"score_gpt":0.3154488165771951,"score_spread":0.2950950189211607,"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."}}