{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000730871,0.002118345,0.002099657,0.001463461,0.001110183,0.002432395,0.003079519,0.001601509,0.02068226],"category_scores_gemma":[0.003612358,0.000638095,0.001356206,0.002685507,0.0007447181,0.004355762,0.002367332,0.002425234,0.004714459],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002271613,"about_ca_system_score_gemma":0.003459694,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007353985,"about_ca_topic_score_gemma":0.01239698,"domain_scores_codex":[0.9989187,0.0001580447,0.00004729693,0.0002973986,0.0002501337,0.0003284386],"domain_scores_gemma":[0.9982681,0.000713894,0.0001282586,0.0004517094,0.0002426274,0.0001953347],"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.003030274,0.001319778,0.003118438,0.001232307,0.0002346104,0.000319764,0.0005578392,0.2075832,0.02369607,0.04214173,0.0682582,0.6485079],"study_design_scores_gemma":[0.0004958536,0.0002163639,0.000676304,0.00005166548,0.0001205054,0.0001924762,0.0002794006,0.9214605,0.005364041,0.06519517,0.005920611,0.00002710342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1718158,0.002233857,0.7813057,0.002510317,0.0003477821,0.0005354858,0.002533826,0.01002868,0.02868859],"genre_scores_gemma":[0.4293143,0.0006751156,0.5498824,0.0005187794,0.0001413397,0.0003880012,0.005427449,0.0008799082,0.01277263],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02068226,"threshold_uncertainty_score":0.06918913,"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."}}