{"id":"W2407224220","doi":"","title":"An Algorithm for the Maximum Weight Independent Set Problem onOutersting Graphs.","year":2015,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Maximal independent set; Computer science; Independent set; Algorithm; Set (abstract data type); Theoretical computer science; Chordal graph; Graph; 1-planar 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.001641424,0.002408419,0.001911834,0.00267492,0.001981714,0.002885225,0.005501938,0.002620934,0.02058345],"category_scores_gemma":[0.007660689,0.001149464,0.002027253,0.004710974,0.00102464,0.006061879,0.00541803,0.003171044,0.004762047],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00214926,"about_ca_system_score_gemma":0.003793109,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004909737,"about_ca_topic_score_gemma":0.0098418,"domain_scores_codex":[0.9984431,0.0003505508,0.0001295276,0.0003594698,0.0004497475,0.0002676976],"domain_scores_gemma":[0.9966413,0.001565521,0.000183024,0.0008400066,0.0005104556,0.0002598811],"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.0008419414,0.001117368,0.001775045,0.001016758,0.0002270073,0.0003445488,0.0004727157,0.10448,0.006741916,0.08442977,0.06359772,0.7349553],"study_design_scores_gemma":[0.0006586235,0.0002976094,0.00112008,0.0001464148,0.0001735968,0.0004985436,0.0002903862,0.6683125,0.006232529,0.2969094,0.02528386,0.00007648791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01723709,0.0007955415,0.9572601,0.00112117,0.0003367698,0.0008085914,0.001360883,0.004693198,0.01638664],"genre_scores_gemma":[0.0730256,0.0004642631,0.9115185,0.0002748494,0.0001777651,0.0007381109,0.003520259,0.0006148384,0.009665778],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02058345,"threshold_uncertainty_score":0.0688585,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05523056529708394,"score_gpt":0.2744272080274784,"score_spread":0.2191966427303945,"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."}}