{"id":"W1759411922","doi":"10.1007/3-540-36136-7_37","title":"Bounded-Degree Independent Sets in Planar Graphs","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Independent set; Combinatorics; Bounded function; Planar graph; Degree (music); Maximal independent set; Planar; Discrete mathematics; Mathematics; Graph; Set (abstract data type); Planar straight-line graph; Upper and lower bounds; 1-planar graph; Computer science; Chordal graph; Physics","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.0002934139,0.0006302897,0.0008683404,0.001573275,0.001413506,0.002398707,0.001589876,0.0009672287,0.005074148],"category_scores_gemma":[0.002607666,0.0009646979,0.0007666079,0.003025616,0.001465128,0.003528044,0.001572289,0.002802552,0.0008261466],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001056258,"about_ca_system_score_gemma":0.0004133851,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007268387,"about_ca_topic_score_gemma":0.001041528,"domain_scores_codex":[0.9996094,0.00006908419,0.00001625815,0.00007531772,0.0001743757,0.00005563441],"domain_scores_gemma":[0.9983495,0.001227411,0.00008787393,0.0001300472,0.0001038019,0.0001014369],"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.00005942175,0.00005135681,0.000276719,0.0002211258,0.00001830134,0.00009737765,0.0003460608,0.01039411,0.001886784,0.9466996,0.006514586,0.03343449],"study_design_scores_gemma":[0.00001433876,0.00001084414,0.0003324295,0.00002470727,0.0000175629,0.0001340467,0.00008102501,0.007671097,0.0007772469,0.9844241,0.006504647,0.000008105209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3508909,0.01025253,0.2831876,0.002933201,0.0005322694,0.0001957272,0.001326581,0.0006697616,0.3500115],"genre_scores_gemma":[0.8726935,0.007225332,0.0600312,0.0003339292,0.0005045071,0.0002882942,0.001441313,0.0002325017,0.05724954],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005074148,"threshold_uncertainty_score":0.01697469,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03810507276962331,"score_gpt":0.2821378396137072,"score_spread":0.2440327668440839,"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."}}