{"id":"W2024836278","doi":"10.1142/s1793830912500085","title":"BOUNDED SEARCH TREE ALGORITHMS FOR PARAMETRIZED COGRAPH DELETION: EFFICIENT BRANCHING RULES BY EXPLOITING STRUCTURES OF SPECIAL GRAPH CLASSES","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Bounded function; Mathematics; Algorithm; Vertex (graph theory); Combinatorics; Treewidth; Tree-depth; Graph; Discrete mathematics; Theoretical computer science; Computer science; Pathwidth; 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.002055174,0.001067547,0.001356034,0.001509535,0.0009281894,0.001841041,0.003372658,0.001508918,0.006340775],"category_scores_gemma":[0.01453181,0.0007458701,0.001737473,0.002482054,0.001530489,0.005318226,0.003136809,0.003119326,0.00158138],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001501388,"about_ca_system_score_gemma":0.002152054,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002689166,"about_ca_topic_score_gemma":0.00398401,"domain_scores_codex":[0.997872,0.000612725,0.0001401676,0.000490746,0.0005771272,0.0003072325],"domain_scores_gemma":[0.9923465,0.005195593,0.0003622092,0.001569298,0.000352242,0.0001740111],"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.000620703,0.0004296467,0.002426459,0.0005191666,0.00009663535,0.000238758,0.0006147542,0.2667276,0.01514455,0.2203427,0.01117689,0.4816621],"study_design_scores_gemma":[0.0001298952,0.00008570014,0.0002250947,0.0000390902,0.00003813649,0.0001322986,0.00006964502,0.7963997,0.005120126,0.1939779,0.003757076,0.00002540746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02159849,0.000233816,0.9733909,0.0002194712,0.00002432611,0.000163704,0.000152616,0.00140599,0.002810681],"genre_scores_gemma":[0.1657634,0.0002693141,0.8291059,0.0002338806,0.00004457734,0.0004448449,0.001054457,0.0007221661,0.002361364],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006340775,"threshold_uncertainty_score":0.02121198,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03785958332532282,"score_gpt":0.3017967662122005,"score_spread":0.2639371828868777,"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."}}