{"id":"W2898301962","doi":"10.1016/j.dam.2018.08.027","title":"Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs","year":2018,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"Core Research for Evolutional Science and Technology; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Constant (computer programming); Planar; Decomposition; Combinatorics; Approximation algorithm; Factor (programming language); Algorithm; Planar graph; Discrete mathematics; Graph; Computer science","routes":{"ca_aff":true,"ca_fund":true,"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":[],"consensus_categories":[],"category_scores_codex":[0.0003893465,0.0002043798,0.0003443106,0.0001397589,0.0002104805,0.00007959179,0.0006875357,0.00009243034,0.00003000309],"category_scores_gemma":[0.00003577163,0.0001833532,0.0001073875,0.0004312887,0.0003877114,0.0002648901,0.0001118371,0.0001052692,0.00009341032],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002675263,"about_ca_system_score_gemma":0.00005127257,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.328031e-7,"about_ca_topic_score_gemma":4.441341e-7,"domain_scores_codex":[0.9983829,0.00002500199,0.000463805,0.0003540297,0.0004117613,0.0003624674],"domain_scores_gemma":[0.9983807,0.0003423127,0.0002858705,0.0006762905,0.0002156594,0.00009919979],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003479289,0.0001279824,0.000002229213,0.0001890719,0.00005853508,6.878046e-7,0.001683902,0.00001350053,0.06437057,0.8997318,0.0001529094,0.03363402],"study_design_scores_gemma":[0.0005728091,0.0001648705,0.000007383685,0.00004024009,0.00001248184,0.000006129168,0.00005814467,0.3749943,0.0649355,0.5588729,0.0001314199,0.0002038275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009071812,0.00001414688,0.9866236,0.00005351348,0.00005771347,0.000967416,0.0001233086,0.0001499368,0.002938512],"genre_scores_gemma":[0.06310245,0.000003773118,0.9365804,0.00004046672,0.00004900769,0.00009127975,0.00004995759,0.00003061552,0.00005208622],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3749808,"threshold_uncertainty_score":0.7476925,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01961415246806685,"score_gpt":0.3005821580958938,"score_spread":0.2809680056278269,"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."}}