{"id":"W2047444378","doi":"10.1016/j.dam.2006.02.003","title":"Improved bottleneck domination algorithms","year":2006,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Bottleneck; Dominating set; Chordal graph; Mathematics; Combinatorics; Treewidth; Time complexity; Independent set; Maximal independent set; Interval graph; Discrete mathematics; Algorithm; Graph; Pathwidth; 1-planar graph; Computer science; Vertex (graph theory); 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.005077902,0.00196073,0.002742439,0.002836827,0.002548967,0.003884078,0.00720961,0.002571334,0.02257573],"category_scores_gemma":[0.01968419,0.001135672,0.001969622,0.00378927,0.002103098,0.007543852,0.008013256,0.005036971,0.004600503],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003234281,"about_ca_system_score_gemma":0.003858318,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00248893,"about_ca_topic_score_gemma":0.003848709,"domain_scores_codex":[0.9949481,0.00156794,0.0002517887,0.001033424,0.001364539,0.0008341202],"domain_scores_gemma":[0.9856111,0.006695532,0.0004836227,0.004531763,0.001752623,0.0009253824],"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.002285381,0.001106193,0.001730561,0.0007328328,0.000246347,0.0001019341,0.0006886777,0.1108878,0.01126833,0.3846149,0.06266367,0.4236733],"study_design_scores_gemma":[0.0004455436,0.000171525,0.0005833862,0.00007087713,0.0001560519,0.0001064023,0.00008426722,0.5376911,0.005669451,0.4403498,0.01461016,0.00006149918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06437522,0.00176776,0.8658007,0.001939519,0.0006623459,0.0003815567,0.001026862,0.006250661,0.05779541],"genre_scores_gemma":[0.4625618,0.0009961001,0.4901592,0.00116004,0.0007576851,0.0008565799,0.002236832,0.00194271,0.03932896],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02257573,"threshold_uncertainty_score":0.07552338,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01158698130081266,"score_gpt":0.2668749870525507,"score_spread":0.255288005751738,"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."}}