{"id":"W2029854525","doi":"10.1016/j.jcss.2003.12.001","title":"Approximation algorithms for classes of graphs excluding single-crossing graphs as minors","year":2004,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Treewidth; Clique-sum; 1-planar graph; Partial k-tree; Pathwidth; Chordal graph; Combinatorics; Indifference graph; Mathematics; Discrete mathematics; Maximal independent set; Tree-depth; Planar graph; Independent set; Vertex cover; Cograph; Time complexity; Graph; Line 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.002639805,0.00250743,0.003097021,0.002737481,0.00272022,0.006190877,0.007063049,0.003346749,0.01179835],"category_scores_gemma":[0.01735193,0.001747348,0.003046453,0.004355425,0.001599981,0.009927894,0.003356846,0.004235793,0.00196039],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004396734,"about_ca_system_score_gemma":0.0033475,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004986884,"about_ca_topic_score_gemma":0.009249376,"domain_scores_codex":[0.9974739,0.0005654928,0.0001403637,0.0007568458,0.0004897013,0.0005737766],"domain_scores_gemma":[0.9835835,0.009953802,0.001196505,0.003365915,0.0009440671,0.0009561446],"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.005798506,0.002934107,0.0122995,0.001460057,0.0005174755,0.0003383356,0.001585397,0.2918164,0.009254125,0.179123,0.05673875,0.4381344],"study_design_scores_gemma":[0.000600214,0.0002496837,0.001486783,0.00008688572,0.0002847808,0.0005170754,0.0003856359,0.7286946,0.003531831,0.2576859,0.006432117,0.000044475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.360985,0.002433259,0.60413,0.004247173,0.0003729905,0.0006030849,0.00266571,0.005011299,0.0195514],"genre_scores_gemma":[0.6311157,0.001291734,0.3464901,0.0009326407,0.0005089103,0.0004663499,0.007504696,0.00143411,0.01025577],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01179835,"threshold_uncertainty_score":0.03946942,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06961559235493293,"score_gpt":0.3323560924359493,"score_spread":0.2627405000810164,"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."}}