{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005020163,0.001976375,0.003191806,0.003314467,0.003219839,0.004295709,0.007540291,0.003062056,0.008267081],"category_scores_gemma":[0.02512751,0.001879768,0.002828684,0.005920014,0.002736498,0.01208439,0.006525571,0.005663151,0.001704064],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002878652,"about_ca_system_score_gemma":0.004217112,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002715503,"about_ca_topic_score_gemma":0.005694505,"domain_scores_codex":[0.9947212,0.002057042,0.0002001766,0.00102411,0.001399185,0.0005983114],"domain_scores_gemma":[0.9781988,0.01482552,0.001203076,0.003377867,0.001315073,0.001079723],"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.002326117,0.001247859,0.00298593,0.0009568576,0.0003557094,0.0001239301,0.001084886,0.2017445,0.004152299,0.4615447,0.02469951,0.2987777],"study_design_scores_gemma":[0.0002243279,0.0001197837,0.0006218146,0.00007380448,0.0001334105,0.0001136021,0.0001775628,0.5850298,0.003321247,0.4045855,0.005554794,0.00004424138],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06161339,0.001229122,0.914891,0.001545548,0.0001678283,0.0003879715,0.0007180913,0.001334431,0.01811259],"genre_scores_gemma":[0.3242281,0.0009145344,0.6582922,0.0005285665,0.0005067309,0.001070039,0.002329427,0.0008447275,0.01128565],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008267081,"threshold_uncertainty_score":0.02765614,"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."}}