{"id":"W2156882907","doi":"10.46298/dmtcs.2126","title":"A randomized algorithm for finding a maximum clique in the visibility graph of a simple polygon","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"Javna Agencija za Raziskovalno Dejavnost RS; European Social Fund; Fonds De La Recherche Scientifique - FNRS; European Science Foundation","keywords":"Combinatorics; Mathematics; Clique graph; Randomized algorithm; Algorithm; Clique; Block graph; Hamiltonian path; Graph; Polygon (computer graphics); Simple polygon; Clique problem; Discrete mathematics; Graph power; Chordal graph; Monotone polygon; Line graph; Computer science; 1-planar 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01071498,0.0001878537,0.0004635826,0.0003000536,0.0001776389,0.0003146484,0.001816564,0.00005257038,0.00000344709],"category_scores_gemma":[0.0008286553,0.0001204325,0.000190307,0.001641702,0.00124393,0.0004346012,0.0004239703,0.0001380231,0.000002880829],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003905402,"about_ca_system_score_gemma":0.0002169697,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005946822,"about_ca_topic_score_gemma":0.000001386172,"domain_scores_codex":[0.997215,0.0003371861,0.0006727865,0.0005102103,0.0008618418,0.0004029992],"domain_scores_gemma":[0.9965786,0.002018285,0.0002122382,0.0006875457,0.0003585182,0.000144793],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001382162,0.0001226921,0.000003429868,0.00002555316,0.000006279951,0.000001665699,0.004101998,0.0006892413,0.00005791613,0.9821106,0.00002100339,0.01272141],"study_design_scores_gemma":[0.004321287,0.00008712448,0.000009259167,0.00001765086,0.00000597695,0.00001002179,0.00006241746,0.5120723,0.0004863986,0.4828399,0.000006207421,0.0000814775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0244482,0.00003202196,0.9731909,0.0006514297,0.0002003817,0.0009838714,0.000006584147,0.00003923685,0.0004473419],"genre_scores_gemma":[0.5314069,0.000001054885,0.4683402,0.0001553361,0.0000377281,0.00005022993,0.000003146548,0.000003981935,0.000001360631],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5113831,"threshold_uncertainty_score":0.4911096,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02834525095212346,"score_gpt":0.3103675416197786,"score_spread":0.2820222906676552,"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."}}