{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007104402,0.001218937,0.0009590531,0.0007484562,0.0005169403,0.001060485,0.001338901,0.00150615,0.004586848],"category_scores_gemma":[0.003650981,0.0005932864,0.0007660898,0.001423957,0.0007116931,0.002289427,0.001276521,0.0007149449,0.0003708144],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001009865,"about_ca_system_score_gemma":0.0008305063,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001333317,"about_ca_topic_score_gemma":0.00155267,"domain_scores_codex":[0.9993856,0.0002161926,0.00002786996,0.0001652948,0.0001065192,0.00009848236],"domain_scores_gemma":[0.9989287,0.0006586044,0.0001726318,0.00007686549,0.00008993466,0.00007317579],"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.0001590052,0.0001010679,0.0007608674,0.0004249705,0.00006368417,0.0002598295,0.0000898322,0.9008273,0.002770056,0.0375215,0.003556251,0.05346563],"study_design_scores_gemma":[0.0001126683,0.0002262863,0.0004277678,0.00003618754,0.00005982691,0.0003118468,0.0001352075,0.9205226,0.003260325,0.0679259,0.006957137,0.00002423627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1082825,0.0005496306,0.877617,0.001467935,0.00006341361,0.0003317136,0.001187341,0.0005199688,0.009980578],"genre_scores_gemma":[0.6251795,0.001040474,0.3653854,0.0002590594,0.00009453431,0.000475418,0.001622499,0.0001606529,0.005782323],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004586848,"threshold_uncertainty_score":0.0153445,"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."}}