{"id":"W1968027460","doi":"10.1016/s0166-218x(02)00418-3","title":"Maximum independent set and maximum clique algorithms for overlap graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta","keywords":"Chordal graph; Mathematics; Combinatorics; Maximal independent set; Split graph; Indifference graph; Treewidth; Independent set; Clique-sum; Pathwidth; Discrete mathematics; Cograph; Vertex (graph theory); Clique problem; 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009822464,0.0003131481,0.0003795903,0.0001894821,0.0002364297,0.0002168361,0.0007696947,0.0001405796,0.00001299001],"category_scores_gemma":[0.0001050896,0.0002759465,0.0001136709,0.0004107803,0.0001643091,0.0002627043,0.0002936155,0.0002584301,0.00002501241],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003888376,"about_ca_system_score_gemma":0.00005929209,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001117387,"about_ca_topic_score_gemma":0.000002071391,"domain_scores_codex":[0.9977658,0.00004207544,0.0004226881,0.0006192756,0.0004977103,0.0006524481],"domain_scores_gemma":[0.9981602,0.000413038,0.0001722648,0.0009377156,0.00008839391,0.0002283161],"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.00001109103,0.00005976857,0.00002121677,0.0001599846,0.00003606562,0.0000056067,0.0008610229,0.00001919236,0.001485385,0.9925941,0.0001048823,0.004641747],"study_design_scores_gemma":[0.0007878256,0.00008304486,0.00002161418,0.00002097986,0.00001393225,0.0000366752,0.0006053261,0.005559623,0.006571754,0.9842333,0.001714282,0.0003516886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007900526,0.000105743,0.9828382,0.0001122994,0.0001034857,0.001180941,0.00003149648,0.0001659762,0.00756137],"genre_scores_gemma":[0.1639113,0.00007001184,0.8349958,0.0002133796,0.00002571025,0.0004842352,0.0000140682,0.00006767824,0.0002178146],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1560108,"threshold_uncertainty_score":0.9999692,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03023874649534522,"score_gpt":0.3033645190743955,"score_spread":0.2731257725790502,"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."}}