{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001383521,0.001877852,0.002566929,0.001530524,0.001548429,0.007696168,0.005228328,0.003203802,0.02507737],"category_scores_gemma":[0.01704775,0.001787587,0.002732415,0.004243924,0.001861935,0.01016524,0.003442443,0.003745173,0.002671353],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003010219,"about_ca_system_score_gemma":0.002843326,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008538807,"about_ca_topic_score_gemma":0.01172564,"domain_scores_codex":[0.99689,0.0008604549,0.0002443646,0.0006861626,0.0009065007,0.0004125469],"domain_scores_gemma":[0.9748502,0.02084629,0.00116853,0.001643128,0.0008163595,0.0006755903],"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.002493419,0.000913093,0.007770151,0.00326714,0.0004430407,0.0008449731,0.001573596,0.5354384,0.01280359,0.1090151,0.04909904,0.2763384],"study_design_scores_gemma":[0.0004490396,0.0001887872,0.00202222,0.00008695437,0.0001868365,0.0005049068,0.0005626616,0.7874126,0.003792074,0.2002852,0.004448323,0.00006037876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5489074,0.002839424,0.3766651,0.00838828,0.0003492707,0.0006970246,0.01038347,0.003966704,0.04780325],"genre_scores_gemma":[0.6914072,0.002156993,0.2626318,0.0006799615,0.0004402937,0.0005280983,0.01599523,0.001732742,0.0244276],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02507737,"threshold_uncertainty_score":0.08389217,"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."}}