{"id":"W2382079786","doi":"10.1016/j.comgeo.2016.05.001","title":"An algorithm for the maximum weight independent set problem on outerstring graphs","year":2016,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Mathematics; Intersection graph; Independent set; Indifference graph; Chordal graph; Split graph; Block graph; Maximal independent set; Circle graph; Discrete mathematics; Time complexity; 1-planar graph; Pathwidth; Cograph; 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.0009672582,0.001592226,0.001651577,0.002063489,0.001286577,0.00188538,0.003672769,0.001778841,0.01351045],"category_scores_gemma":[0.004343982,0.0009447982,0.001631093,0.002894775,0.0008587774,0.003160076,0.004701316,0.002577421,0.003521574],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001189,"about_ca_system_score_gemma":0.001767318,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002687728,"about_ca_topic_score_gemma":0.004715045,"domain_scores_codex":[0.9992304,0.0001652065,0.00004155872,0.00016247,0.0002701642,0.0001302424],"domain_scores_gemma":[0.998349,0.0007939039,0.00009665767,0.000344079,0.0002957346,0.0001206786],"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.0004785435,0.0004264541,0.0009051124,0.0004788492,0.0001185052,0.0001958454,0.0002968329,0.2625783,0.007420895,0.0928735,0.02248214,0.6117451],"study_design_scores_gemma":[0.0001624878,0.00009224177,0.0002510152,0.00004309043,0.0000412528,0.00008739557,0.00007306792,0.8742419,0.002966073,0.1148453,0.007174506,0.00002168999],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009690318,0.0001251968,0.981311,0.0002861324,0.00008855771,0.0001655361,0.00021536,0.00135902,0.006758848],"genre_scores_gemma":[0.061032,0.0001465996,0.9304994,0.0001366881,0.00006757463,0.0003503128,0.000962369,0.0005051123,0.006299887],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01351045,"threshold_uncertainty_score":0.04519689,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02095456718722194,"score_gpt":0.2671733349264159,"score_spread":0.246218767739194,"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."}}