{"id":"W2076513440","doi":"10.1016/j.dam.2006.03.003","title":"Approximating the minimum clique cover and other hard problems in subtree filament graphs","year":2006,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta; University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Chordal graph; Clique-sum; Mathematics; Indifference graph; Maximal independent set; Discrete mathematics; Split graph; Treewidth; Clique problem; Pathwidth; 1-planar graph; Graph; Line graph","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005798712,0.00021655,0.0002581196,0.00009369942,0.0001557391,0.0002442648,0.0006370632,0.00006557321,0.00001381292],"category_scores_gemma":[0.00001263943,0.0001515787,0.00006397725,0.0003826079,0.0001544683,0.0001152449,0.0003132541,0.0001987008,0.00001978596],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002055516,"about_ca_system_score_gemma":0.00001805483,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004379216,"about_ca_topic_score_gemma":0.00003645968,"domain_scores_codex":[0.9985053,0.00002655063,0.0004742916,0.0003504886,0.0003014975,0.0003419015],"domain_scores_gemma":[0.9989273,0.00023058,0.0001896069,0.0005939335,0.00001751658,0.00004105956],"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.000001775491,0.0001166718,0.0002513885,0.0001497879,0.00001317749,0.000001934295,0.003088741,0.0002836224,0.0008692244,0.9933071,0.0003383933,0.00157818],"study_design_scores_gemma":[0.0005134875,0.00002837089,0.0008223336,0.0001041583,0.00001126762,0.00001371956,0.0004448692,0.1584854,0.0008134951,0.8369189,0.001511297,0.0003327076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1079609,0.0002057042,0.8501416,0.0007042011,0.0001071679,0.001455237,0.00001718309,0.0002213382,0.0391866],"genre_scores_gemma":[0.6056417,0.00001433237,0.393192,0.0005228292,0.00005818149,0.000279036,0.00000593133,0.00003608473,0.0002499006],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4976808,"threshold_uncertainty_score":0.6181199,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02075088468609134,"score_gpt":0.2299815812574832,"score_spread":0.2092306965713919,"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."}}