{"id":"W1551586077","doi":"10.1007/978-3-319-12340-0_20","title":"Near-Linear Time Constant-Factor Approximation Algorithm for Branch-Decomposition of Planar Graphs","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Planar graph; Planar; Mathematics; Constant (computer programming); Treewidth; Graph; Discrete mathematics; Physics; Pathwidth; Computer science","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.0007377589,0.002775565,0.00235536,0.001631488,0.001226974,0.002888047,0.003858022,0.001914673,0.02653755],"category_scores_gemma":[0.003222503,0.0008511571,0.001702691,0.003702559,0.0007954024,0.005220795,0.002812149,0.003106146,0.007867556],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002559077,"about_ca_system_score_gemma":0.003186991,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007229026,"about_ca_topic_score_gemma":0.0116018,"domain_scores_codex":[0.9988161,0.0001626814,0.0000546704,0.0003343945,0.0002972873,0.0003348904],"domain_scores_gemma":[0.998389,0.0006336889,0.0001057746,0.0004532069,0.0002460484,0.0001723136],"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.002090951,0.001118266,0.00163623,0.001287042,0.0002012092,0.0002401103,0.0004997374,0.127571,0.02109649,0.03943315,0.08874761,0.7160783],"study_design_scores_gemma":[0.0006614872,0.0002684782,0.000764681,0.00008554906,0.0001667868,0.0003003116,0.0003628219,0.8775657,0.007669991,0.09989977,0.01220979,0.00004469429],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1131402,0.003140074,0.8238571,0.002261404,0.0004226247,0.0005693668,0.003188202,0.01347317,0.03994794],"genre_scores_gemma":[0.2633213,0.001004666,0.7080908,0.0005189964,0.000190025,0.0004712218,0.007402886,0.001375135,0.01762497],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02653755,"threshold_uncertainty_score":0.08877689,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0165859407235565,"score_gpt":0.2800499969145098,"score_spread":0.2634640561909533,"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."}}