{"id":"W1521937241","doi":"10.1007/978-3-642-18469-7_28","title":"Complexity of Finding Non-Planar Rectilinear Drawings of Graphs","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Council; Michael Smith Health Research BC","keywords":"Vertex (graph theory); Planar graph; Combinatorics; NP-complete; Planar; Time complexity; Enhanced Data Rates for GSM Evolution; Computer science; Computational complexity theory; Degree (music); Mathematics; Discrete mathematics; Graph; Algorithm; Artificial intelligence; Computer graphics (images)","routes":{"ca_aff":true,"ca_fund":true,"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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000889167,0.0003431361,0.000579163,0.001256314,0.0001457047,0.00007760162,0.001999767,0.0002124923,0.00002561063],"category_scores_gemma":[0.00007703664,0.0003350509,0.0001699067,0.001007218,0.0008928227,0.0004138139,0.0005153535,0.0004157021,0.000008223002],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007900434,"about_ca_system_score_gemma":0.0004482145,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006692281,"about_ca_topic_score_gemma":0.00004081093,"domain_scores_codex":[0.9971914,0.00003171284,0.0007035846,0.000904145,0.0008205279,0.0003486075],"domain_scores_gemma":[0.997677,0.0003280155,0.0005918074,0.0008405456,0.0004581843,0.0001044801],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003504106,0.0001436244,0.0003491999,0.0002802118,0.0000570974,0.00003711315,0.003447702,0.03647175,0.005501368,0.3572338,0.0000602986,0.5963828],"study_design_scores_gemma":[0.0003105732,0.0003641346,0.001209642,0.0004743593,0.00001425446,0.0000440728,2.244457e-7,0.2420223,0.0423816,0.7123719,0.0002761661,0.0005308358],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001680577,0.0001725392,0.9934807,0.0001024681,0.001156828,0.0002546356,0.000009774375,0.00004297547,0.003099544],"genre_scores_gemma":[0.5469707,0.00002504444,0.4525676,0.0001707363,0.0001241276,0.000002416643,0.000009712146,0.00001487759,0.0001147853],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.595852,"threshold_uncertainty_score":0.9999102,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04288147402704064,"score_gpt":0.2629311760948533,"score_spread":0.2200497020678127,"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."}}