{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001108461,0.0004848411,0.0007013113,0.0009088936,0.0003091434,0.0002481009,0.00263854,0.000322064,0.00001921748],"category_scores_gemma":[0.00009711346,0.0004602554,0.0002198134,0.0006705005,0.001364475,0.0005507118,0.0004398971,0.0005467772,0.00003197336],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001574646,"about_ca_system_score_gemma":0.0003835277,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004746623,"about_ca_topic_score_gemma":0.000004605032,"domain_scores_codex":[0.9961835,0.00007622888,0.0006677886,0.001321551,0.001073904,0.0006770493],"domain_scores_gemma":[0.9963067,0.001217306,0.0004828417,0.001255426,0.0005596348,0.0001781261],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002266952,0.00003169385,0.000007606803,0.00008988168,0.00002085748,0.000006908276,0.0002900593,0.005425883,0.001882665,0.09359191,0.00001437993,0.8986155],"study_design_scores_gemma":[0.0003410271,0.0002705059,0.00001030956,0.0001868167,0.000004740125,0.00002298721,4.509619e-8,0.6008177,0.004370524,0.3933639,0.0002824503,0.0003290091],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001012821,0.0001488999,0.9972609,0.0001912348,0.0005691354,0.0009904408,0.00008316621,0.000137074,0.0005179226],"genre_scores_gemma":[0.01287209,0.000016137,0.9863961,0.000276919,0.0001758096,0.00002281419,0.00004035097,0.00004467076,0.0001550959],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8982865,"threshold_uncertainty_score":0.9997849,"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."}}