{"id":"W2095382269","doi":"10.1016/j.dam.2014.12.017","title":"Practical algorithms for branch-decompositions of planar graphs","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University; D-Wave Systems (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Mathematics; Planar graph; Algorithm; Time complexity; Graph; Planar; Decomposition; Combinatorics; Discrete mathematics; Computer science; Mathematical optimization","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006029375,0.0001517273,0.0002848956,0.0001390535,0.00008579425,0.00005656648,0.0006306779,0.00006573096,0.000003671018],"category_scores_gemma":[0.000134563,0.000131836,0.00009758521,0.0003899552,0.0001507964,0.000239993,0.0001431143,0.000133704,0.00002663019],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002363933,"about_ca_system_score_gemma":0.0000913216,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001019307,"about_ca_topic_score_gemma":8.912668e-7,"domain_scores_codex":[0.9985753,0.00002178497,0.0003590829,0.0002780462,0.0004368819,0.0003289339],"domain_scores_gemma":[0.9981884,0.0005912238,0.0001712183,0.000687915,0.000164155,0.0001971119],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001897266,0.0001321352,0.000001967696,0.00007655717,0.00003041299,0.000001849158,0.0008245052,0.00003821953,0.002569643,0.9942595,0.001118106,0.0009281251],"study_design_scores_gemma":[0.0006123912,0.0001144555,0.000004726901,0.00001846348,0.00001597646,0.00001989679,0.0003457592,0.02304151,0.008798538,0.9663062,0.000555399,0.0001666772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009157803,0.00002112499,0.9912934,0.0004612835,0.00006467327,0.000610395,0.00003416765,0.0001058184,0.00649336],"genre_scores_gemma":[0.06302962,0.000004303855,0.9366502,0.00004651311,0.00002432268,0.0001587918,0.00001604098,0.00002145868,0.00004877343],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.06211383,"threshold_uncertainty_score":0.5376118,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.078365028692375,"score_gpt":0.3703406906755415,"score_spread":0.2919756619831665,"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."}}