{"id":"W2144241285","doi":"10.1145/2831235","title":"The Two-Edge Connectivity Survivable-Network Design Problem in Planar Graphs","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Mathematics; Planar graph; Steiner tree problem; Discrete mathematics; Cograph; Vertex (graph theory); Disjoint sets; Time complexity; Graph; 1-planar graph; Chordal graph","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001766994,0.0002396794,0.0002539605,0.0001431486,0.0006566477,0.0001974383,0.00122016,0.0001126332,0.00002297195],"category_scores_gemma":[0.00003518616,0.0001416919,0.0001394721,0.0008499062,0.00009034578,0.0004637337,0.00001617257,0.000294972,0.00009685601],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001343616,"about_ca_system_score_gemma":0.0000738342,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00027199,"about_ca_topic_score_gemma":0.0007533091,"domain_scores_codex":[0.9974657,0.0006242327,0.0004267346,0.0005479702,0.000309993,0.0006254087],"domain_scores_gemma":[0.9963285,0.002228482,0.0001119909,0.00112056,0.00009854777,0.0001119605],"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.0001116163,0.0002642682,0.0002419301,0.000009398846,0.0001403549,0.00003506561,0.00043634,0.03709394,0.000215948,0.04899409,0.002626033,0.909831],"study_design_scores_gemma":[0.01014697,0.002368579,0.004408345,0.001175773,0.00006692043,0.0004785304,0.0004416213,0.4253736,0.005667954,0.4838399,0.06311356,0.002918224],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004860437,0.0001022117,0.9936659,0.002588199,0.001846767,0.0005030452,0.000006046428,0.0002152309,0.0005865765],"genre_scores_gemma":[0.9193829,0.0002149884,0.07818931,0.000269381,0.0002313322,0.0003572151,6.159947e-7,0.00003402581,0.001320225],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9188969,"threshold_uncertainty_score":0.577803,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0288699914690636,"score_gpt":0.2498239591656595,"score_spread":0.2209539676965959,"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."}}