{"id":"W2186560431","doi":"","title":"Maximum Independent Set for Interval Graphs and Trees in Space Efficient Models.","year":2014,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Interval (graph theory); Maximal independent set; Set (abstract data type); Interval graph; Combinatorics; Space (punctuation); Independent set; Mathematics; Upper and lower bounds; Discrete mathematics; Product (mathematics); Algorithm; Computer science; Pathwidth; Graph; Line 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.002755373,0.001371221,0.001916279,0.002029828,0.001229401,0.00503184,0.00430143,0.002229429,0.009010656],"category_scores_gemma":[0.01411468,0.001287947,0.002948141,0.00386958,0.001953196,0.01388379,0.003838443,0.00382282,0.001427446],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003281295,"about_ca_system_score_gemma":0.001975551,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002987363,"about_ca_topic_score_gemma":0.004091981,"domain_scores_codex":[0.996849,0.001294286,0.0001171434,0.0005665116,0.000778267,0.000394736],"domain_scores_gemma":[0.9917823,0.005883228,0.0005528178,0.00125044,0.0002397479,0.0002914254],"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.0006081686,0.0002843176,0.001072465,0.0005178719,0.0002368131,0.0002099144,0.0004254975,0.3593774,0.003842629,0.5483079,0.01360549,0.07151159],"study_design_scores_gemma":[0.00005016095,0.00005816469,0.0001956235,0.00003986795,0.00004363769,0.0001163359,0.00009342467,0.527191,0.001067422,0.467365,0.003760111,0.00001932227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04586387,0.001930052,0.9353945,0.001634333,0.0001335339,0.0001783861,0.0009198505,0.001015659,0.01292973],"genre_scores_gemma":[0.6127746,0.00211951,0.3732214,0.0003369507,0.0005177758,0.0004834059,0.002061443,0.0004250748,0.008059882],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009010656,"threshold_uncertainty_score":0.03014362,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04062558458719696,"score_gpt":0.28570176632086,"score_spread":0.2450761817336631,"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."}}