{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002198118,0.0001373024,0.0003579654,0.0006509203,0.0005068444,0.0006047759,0.0009005125,0.00004590524,2.687177e-7],"category_scores_gemma":[0.00004354903,0.0001008304,0.0001630279,0.0009388895,0.0005237313,0.001479533,0.0001277174,0.0001045941,3.799277e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004785849,"about_ca_system_score_gemma":0.0002002782,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000703693,"about_ca_topic_score_gemma":0.000001157971,"domain_scores_codex":[0.9979674,0.0001058409,0.0006474662,0.0002718611,0.0007066444,0.0003007653],"domain_scores_gemma":[0.9982839,0.0003516615,0.0006455713,0.0001663407,0.0004245271,0.0001280215],"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.00005172482,0.0001773249,0.001423323,0.000517036,0.0000745812,0.00003200422,0.004446792,0.008612424,0.0103027,0.8570702,0.00003674225,0.1172551],"study_design_scores_gemma":[0.003734212,0.006023092,0.002407978,0.00264507,0.00004573772,0.003319442,0.003410653,0.1915822,0.04196749,0.7439494,0.0002089692,0.0007057728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.297273,0.0004759259,0.701362,0.0001144741,0.0004865742,0.0001352076,8.092274e-7,0.0000173505,0.000134683],"genre_scores_gemma":[0.7110448,0.000008930742,0.2888602,0.00001675748,0.00006002007,0.000001930096,9.281061e-8,0.000003627734,0.000003618852],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4137719,"threshold_uncertainty_score":0.5831868,"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."}}