{"id":"W2143973853","doi":"10.1007/978-3-319-03841-4_33","title":"Minimum Length Embedding of Planar Graphs at Fixed Vertex Locations","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Planar graph; Embedding; Vertex (graph theory); Book embedding; Vertex cover; Planar; Approximation algorithm; Time complexity; Planar straight-line graph; Discrete mathematics; Mathematics; Graph; Computer science; 1-planar graph; Chordal 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.0002233778,0.001330994,0.0007804552,0.0008325775,0.0005296857,0.001090712,0.002157556,0.001228141,0.007935103],"category_scores_gemma":[0.002766888,0.0009469715,0.0005105155,0.001181875,0.0007099007,0.003075238,0.002264623,0.002232114,0.001894228],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007264505,"about_ca_system_score_gemma":0.0003228893,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008063033,"about_ca_topic_score_gemma":0.001349752,"domain_scores_codex":[0.9996378,0.00007387143,0.00002017307,0.00008717614,0.0001393706,0.00004150844],"domain_scores_gemma":[0.9987563,0.000539838,0.0002262093,0.0002267664,0.0001381131,0.0001127623],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008509257,0.0002102885,0.0009493377,0.001215075,0.00009264673,0.0004417102,0.0006838457,0.3005202,0.04316953,0.4079064,0.01926596,0.2246941],"study_design_scores_gemma":[0.0001106836,0.0002652927,0.0009134124,0.0001469263,0.00005718658,0.0003307199,0.000255856,0.3340552,0.01158644,0.6351494,0.01706687,0.00006186211],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3327269,0.001871796,0.5908747,0.001206841,0.0002877023,0.0001206618,0.002181638,0.001221003,0.0695088],"genre_scores_gemma":[0.6348928,0.002283363,0.3126952,0.0001720089,0.0002129959,0.000243982,0.002976091,0.001095413,0.04542827],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007935103,"threshold_uncertainty_score":0.02654558,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01653059770991138,"score_gpt":0.2465548600993402,"score_spread":0.2300242623894288,"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."}}