{"id":"W2030012922","doi":"10.1145/1597036.1597043","title":"A linear-time algorithm to find a separator in a graph excluding a minor","year":2009,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Time complexity; Graph; Algorithm; Separator (oil production); Minor (academic); Discrete mathematics; Physics","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.0004226155,0.0004285182,0.0004668191,0.001144899,0.0003582935,0.0002082052,0.001890767,0.000172936,0.0001083808],"category_scores_gemma":[0.00004826017,0.0004495379,0.000287941,0.003282149,0.00006247234,0.0006144574,0.00004505563,0.0005836147,0.0004389653],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001223363,"about_ca_system_score_gemma":0.0001055921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008791836,"about_ca_topic_score_gemma":0.00002402742,"domain_scores_codex":[0.9969416,0.0001185942,0.0005536884,0.0009997635,0.0005791699,0.0008071885],"domain_scores_gemma":[0.9977133,0.0002441877,0.0000826102,0.001472542,0.0001061826,0.0003811257],"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.0000220736,0.0006472302,0.000004351651,0.000004862475,0.00003132698,0.00009517118,0.00102722,0.001490695,0.000724997,0.000346233,0.0002617895,0.995344],"study_design_scores_gemma":[0.004397157,0.003277374,0.008828852,0.0004057168,0.00006234054,0.000363956,0.0002001951,0.8937427,0.01107479,0.06367574,0.01131679,0.002654413],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006138503,0.00008757062,0.9876007,0.004311488,0.0004934293,0.0005583628,0.0000594695,0.000426275,0.0003242318],"genre_scores_gemma":[0.03613881,0.00003450321,0.9599901,0.002535832,0.0001543858,0.0001297511,0.000005054077,0.0000293591,0.0009822493],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9926896,"threshold_uncertainty_score":0.9997956,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02838027666210273,"score_gpt":0.2910431303259928,"score_spread":0.26266285366389,"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."}}