{"id":"W1514238746","doi":"10.1007/978-3-540-68552-4_7","title":"Computing Branch Decomposition of Large Planar Graphs","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Planar graph; Time complexity; Pathwidth; Subroutine; Mathematics; Planar; Book embedding; Algorithm; Combinatorics; Modular decomposition; Graph; Discrete mathematics; Computer science; Line graph","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.000545917,0.001605274,0.00160514,0.002208161,0.0009540607,0.003049487,0.001990458,0.001299875,0.0181072],"category_scores_gemma":[0.003961706,0.001035382,0.001175858,0.003142331,0.0008189112,0.00505709,0.002307877,0.002272692,0.004478084],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001086462,"about_ca_system_score_gemma":0.00100583,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002620914,"about_ca_topic_score_gemma":0.008064589,"domain_scores_codex":[0.9995229,0.00007058471,0.00002242098,0.0001353246,0.0001402574,0.0001084791],"domain_scores_gemma":[0.9980962,0.00101322,0.0001153012,0.0003284205,0.000258505,0.0001883311],"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.001667561,0.0004773505,0.008629905,0.001531691,0.0002188096,0.0005003841,0.0009808356,0.1974468,0.03692885,0.08706152,0.09340935,0.5711469],"study_design_scores_gemma":[0.0001842736,0.0001346312,0.001887584,0.0001035913,0.0001017271,0.0002062576,0.0005199768,0.7086565,0.009121253,0.2680595,0.01099879,0.00002602743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3984468,0.001948926,0.5404631,0.001663038,0.0001714379,0.0003040429,0.007261339,0.01074626,0.03899504],"genre_scores_gemma":[0.5029821,0.001122674,0.4549746,0.0003018684,0.0001719233,0.0002139255,0.02169875,0.002162195,0.01637195],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0181072,"threshold_uncertainty_score":0.06057465,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0169865635739892,"score_gpt":0.2936271310724247,"score_spread":0.2766405674984355,"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."}}