{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001241786,0.0009234335,0.001570337,0.001023572,0.001374532,0.001622469,0.002921313,0.001817659,0.005484508],"category_scores_gemma":[0.007591572,0.0009191266,0.001512591,0.001445444,0.001795835,0.002796211,0.002947977,0.001718702,0.0009595847],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001594594,"about_ca_system_score_gemma":0.003176967,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003677399,"about_ca_topic_score_gemma":0.0046639,"domain_scores_codex":[0.9977037,0.0005491489,0.0001185318,0.0007938479,0.0004614023,0.0003733705],"domain_scores_gemma":[0.9951148,0.002693515,0.0004700613,0.001144402,0.0002996241,0.0002775166],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001449317,0.0006811678,0.003084001,0.0008097121,0.0002733214,0.0004401168,0.0004782462,0.5326283,0.02433033,0.1054959,0.02182413,0.3085054],"study_design_scores_gemma":[0.0005031255,0.0001692853,0.0004129573,0.00003178059,0.00004193966,0.0001635026,0.00007592801,0.9183542,0.004708113,0.07136694,0.004132743,0.00003955913],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03902961,0.0002374069,0.9532978,0.000652082,0.00008631485,0.000338281,0.0004217176,0.002133588,0.003803243],"genre_scores_gemma":[0.2417361,0.0001005373,0.7544072,0.0001609623,0.00006911396,0.0004125165,0.001014722,0.0002837074,0.001815259],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005484508,"threshold_uncertainty_score":0.01834756,"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."}}