{"id":"W1977677776","doi":"10.1016/s1571-0653(04)00379-8","title":"Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs","year":2001,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Treewidth; Minor (academic); Mathematics; Partial k-tree; Maximization; Combinatorics; 1-planar graph; Discrete mathematics; Planar graph; Bounded function; Graph minor; Minification; Robertson–Seymour theorem; Graph; Pathwidth; Chordal graph; Mathematical optimization; Line graph; Graph power; Mathematical analysis","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.001754308,0.00139352,0.001563734,0.001302092,0.001680712,0.003730875,0.003718604,0.001955991,0.0109055],"category_scores_gemma":[0.009679833,0.0006526685,0.001474602,0.002468269,0.001257648,0.007788377,0.004838951,0.002358166,0.001940222],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003532261,"about_ca_system_score_gemma":0.001920777,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004366199,"about_ca_topic_score_gemma":0.008436184,"domain_scores_codex":[0.9984618,0.0002822032,0.00009679767,0.0002976419,0.0003992362,0.0004623828],"domain_scores_gemma":[0.993959,0.003099449,0.0003515411,0.001769286,0.0004527293,0.0003679793],"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.008126022,0.0006188346,0.003903269,0.001039303,0.0002597582,0.0003255507,0.002123096,0.2211862,0.02492155,0.3111182,0.03487116,0.391507],"study_design_scores_gemma":[0.0004279162,0.0002154655,0.0007595866,0.00008730252,0.0001237267,0.0002122,0.0003725872,0.5665984,0.00952268,0.4132604,0.008358397,0.00006144022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3170265,0.002115764,0.6510224,0.002181112,0.0003232933,0.0002911042,0.00169001,0.005852865,0.01949695],"genre_scores_gemma":[0.6843866,0.0006952183,0.300217,0.0004921585,0.0001423577,0.0002845433,0.002499838,0.0009972579,0.01028511],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0109055,"threshold_uncertainty_score":0.03648257,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0255491360541157,"score_gpt":0.3063829586482106,"score_spread":0.280833822594095,"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."}}