{"id":"W2061541114","doi":"10.1016/s0925-7721(03)00027-0","title":"Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces","year":2003,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia; Carleton University","funders":"","keywords":"Combinatorics; Quadrilateral; Planar graph; Vertex (graph theory); Mathematics; Diagonal; Monochromatic color; Graph; Vertex cover; Plane (geometry); Time complexity; Algorithm; Geometry; 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.001876426,0.002191363,0.001824141,0.001666357,0.001664984,0.002523982,0.003894912,0.002212022,0.012011],"category_scores_gemma":[0.00880221,0.001460581,0.001956813,0.002261864,0.00228295,0.006025604,0.004030083,0.002842546,0.001910682],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00232126,"about_ca_system_score_gemma":0.002670099,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005689574,"about_ca_topic_score_gemma":0.01167654,"domain_scores_codex":[0.9981301,0.0003755711,0.0001185453,0.0004288075,0.0004884353,0.0004585451],"domain_scores_gemma":[0.99471,0.003114584,0.0003230078,0.001236152,0.000394908,0.0002213877],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008309725,0.0003214268,0.001171538,0.0004256734,0.00008525159,0.0001262463,0.0003041097,0.6563628,0.004817795,0.06020742,0.01516679,0.26018],"study_design_scores_gemma":[0.00007572306,0.0000546442,0.0001133484,0.00002030564,0.00003067069,0.00005272521,0.000124315,0.8959647,0.002814214,0.09885154,0.001883946,0.00001391946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04034933,0.0006011623,0.9474444,0.0005867399,0.000131546,0.0001504661,0.0002807029,0.003367746,0.007087947],"genre_scores_gemma":[0.2521197,0.0003624974,0.74002,0.0001873789,0.00008625658,0.0001815574,0.001164649,0.001015387,0.004862601],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.012011,"threshold_uncertainty_score":0.04018074,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02691526093557751,"score_gpt":0.2724761922961346,"score_spread":0.2455609313605571,"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."}}