{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006423175,0.001801193,0.001346008,0.001195943,0.001354604,0.001563578,0.002501067,0.00134218,0.009559499],"category_scores_gemma":[0.002582338,0.0009843563,0.001465771,0.002145454,0.000777252,0.003958456,0.002367627,0.0013134,0.004066859],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00148978,"about_ca_system_score_gemma":0.002660609,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002924104,"about_ca_topic_score_gemma":0.00539548,"domain_scores_codex":[0.9989881,0.0001220471,0.0000950688,0.0003621847,0.0002070853,0.0002255915],"domain_scores_gemma":[0.9982044,0.0008065584,0.0002337035,0.0003917396,0.0001693928,0.0001942137],"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.003636874,0.001235208,0.00517889,0.001686392,0.0003748035,0.0005528064,0.001001525,0.102546,0.06600056,0.0244087,0.03282663,0.7605517],"study_design_scores_gemma":[0.001247477,0.001069931,0.002307584,0.00009443112,0.0002174993,0.001034171,0.0005439824,0.8648168,0.02921746,0.07412276,0.02521732,0.0001106241],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1114832,0.0006518199,0.8617183,0.001141555,0.0001247638,0.0007689424,0.00156163,0.01193419,0.01061557],"genre_scores_gemma":[0.168029,0.0001797039,0.8214245,0.000182845,0.00005547353,0.0003467589,0.003594168,0.0004325181,0.005754995],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009559499,"threshold_uncertainty_score":0.03197974,"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."}}