{"id":"W2897704917","doi":"10.1137/1.9781611975482.37","title":"Finding Maximal Sets of Laminar 3-Separators in Planar Graphs in Linear Time","year":2019,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Laminar flow; Disjoint sets; Combinatorics; Mathematics; Planar graph; Vertex (graph theory); Graph; Discrete mathematics; Planar; Computer science; Physics; Mechanics","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.0004378767,0.001315153,0.001042339,0.00117077,0.001014248,0.002153417,0.001398161,0.001014395,0.009648212],"category_scores_gemma":[0.002847484,0.001059982,0.001820572,0.001850598,0.0008402314,0.004165313,0.0025449,0.001359761,0.002568628],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009488111,"about_ca_system_score_gemma":0.001048123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001238064,"about_ca_topic_score_gemma":0.003102294,"domain_scores_codex":[0.999471,0.00006992825,0.00005267615,0.0001439705,0.0001592722,0.0001031693],"domain_scores_gemma":[0.9983664,0.001017608,0.0002140908,0.0001738207,0.0001203377,0.0001077806],"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.0008400301,0.0004604647,0.004850708,0.002529828,0.0002730407,0.0007705371,0.001304826,0.1107916,0.05298568,0.07192516,0.02513485,0.7281333],"study_design_scores_gemma":[0.0002801143,0.0004880835,0.003496134,0.0003746832,0.0002322799,0.001781168,0.001936798,0.4212173,0.06807656,0.4575237,0.04446848,0.000124726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1777648,0.001117624,0.791105,0.00104195,0.00006699539,0.000402265,0.002278825,0.005428239,0.02079428],"genre_scores_gemma":[0.1571151,0.0006401241,0.8285094,0.0001771251,0.00003563143,0.000187366,0.005023091,0.0006639148,0.007648244],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009648212,"threshold_uncertainty_score":0.03227645,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05912181164447611,"score_gpt":0.2845468274974068,"score_spread":0.2254250158529307,"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."}}