{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001246628,0.0005577502,0.0007561347,0.001781978,0.0004446057,0.0001609956,0.00428069,0.0003274451,0.00001385129],"category_scores_gemma":[0.00007632064,0.0005486065,0.0002381849,0.001335595,0.001186865,0.000683107,0.001322175,0.001090068,0.00002779957],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001985376,"about_ca_system_score_gemma":0.0004387679,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001090375,"about_ca_topic_score_gemma":0.00003060412,"domain_scores_codex":[0.9949911,0.00009068001,0.0007590484,0.001599498,0.001539887,0.001019797],"domain_scores_gemma":[0.9963577,0.0008776648,0.000463158,0.001660129,0.0004198336,0.0002215419],"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.00004351385,0.0001730421,0.0004805441,0.0001778749,0.00005160042,0.0003439048,0.002643225,0.03181094,0.002256715,0.2839443,0.00008614431,0.6779882],"study_design_scores_gemma":[0.000833044,0.0004317384,0.000650214,0.000843657,0.000008242468,0.0003792652,2.834904e-7,0.2933308,0.00840438,0.6930112,0.0009984801,0.001108633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009998789,0.0008328586,0.9942888,0.0001867209,0.0008363507,0.0004301898,0.00001567516,0.0001655609,0.002243984],"genre_scores_gemma":[0.6103906,0.0001700854,0.3884991,0.0005913083,0.0001935295,0.000003937973,0.00001348272,0.00004969433,0.00008821284],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6768795,"threshold_uncertainty_score":0.9996966,"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."}}