{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001601865,0.001279184,0.001973617,0.001746735,0.001256488,0.002812625,0.00369488,0.003495298,0.007315194],"category_scores_gemma":[0.01820461,0.001139329,0.001434015,0.003231451,0.001895317,0.006034955,0.002114969,0.003207228,0.0004753035],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002732844,"about_ca_system_score_gemma":0.001095047,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004523179,"about_ca_topic_score_gemma":0.006657588,"domain_scores_codex":[0.9988172,0.0004001731,0.00003947688,0.0002618525,0.0002779023,0.0002033673],"domain_scores_gemma":[0.9874456,0.01006743,0.0009287154,0.0006796014,0.0003364405,0.0005422597],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006732101,0.0003966731,0.005151734,0.0004125184,0.0001199828,0.0002579191,0.0002657612,0.8484166,0.00212145,0.08294776,0.01380826,0.04542816],"study_design_scores_gemma":[0.00004667184,0.00003662305,0.000722892,0.00001916026,0.00002039902,0.00008145202,0.00007089543,0.9137782,0.0005221721,0.08383396,0.0008590878,0.000008557785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5897815,0.002750274,0.3743251,0.005572112,0.0001954078,0.0002271532,0.002012728,0.0008137512,0.02432208],"genre_scores_gemma":[0.8713132,0.001011878,0.1166645,0.0004278753,0.0003267513,0.0001921848,0.002556984,0.0004039233,0.00710267],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007315194,"threshold_uncertainty_score":0.02447176,"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."}}