{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004820685,0.0003926402,0.0004383622,0.001123516,0.0002985213,0.0002150104,0.001952325,0.0002346245,0.00007142414],"category_scores_gemma":[0.00008719348,0.0003805191,0.0001418975,0.000815641,0.0004058405,0.0005937302,0.0006727274,0.0003621888,0.00009719851],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002342609,"about_ca_system_score_gemma":0.000449261,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002124177,"about_ca_topic_score_gemma":0.0000408931,"domain_scores_codex":[0.9969077,0.00003635141,0.0006019403,0.001089112,0.0009289637,0.0004359563],"domain_scores_gemma":[0.9974572,0.0006473546,0.0003698354,0.0009733058,0.0003973763,0.0001549187],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009116781,0.00007352464,0.00005695111,0.00009062724,0.00004157969,0.00002275127,0.001231354,0.2092748,0.002152493,0.1808675,0.0007513574,0.6054279],"study_design_scores_gemma":[0.0002579537,0.0001504278,0.0003139575,0.0002269016,0.00001096416,0.00004792717,2.561993e-7,0.8132453,0.00300614,0.1803328,0.001895785,0.0005116522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009979379,0.0004523863,0.9938268,0.0004829165,0.00163705,0.0003596681,0.000008885017,0.00008449033,0.002149882],"genre_scores_gemma":[0.3567735,0.00007105783,0.6401928,0.0008818153,0.0002690804,0.00001997047,0.0000484358,0.00003328684,0.001710013],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6049163,"threshold_uncertainty_score":0.9998647,"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."}}