{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004192713,0.0001937491,0.0002180601,0.0001338866,0.0001472882,0.0001688459,0.0008857287,0.00007405467,0.0000160808],"category_scores_gemma":[0.0000291274,0.00016876,0.00007343721,0.0004638056,0.00009300323,0.0002803449,0.0002847863,0.0001554894,0.0001050999],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000049849,"about_ca_system_score_gemma":0.00002932103,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005224215,"about_ca_topic_score_gemma":0.000002969876,"domain_scores_codex":[0.9984421,0.0000166698,0.0003447432,0.0003769453,0.0004031122,0.0004163913],"domain_scores_gemma":[0.9987192,0.0001733477,0.000149061,0.0008094578,0.00007380729,0.00007518273],"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.000003453085,0.00007151035,0.000001861581,0.00004018694,0.000007811991,0.000002810913,0.000207289,0.00006311911,0.03373785,0.9559867,0.0001604817,0.009716938],"study_design_scores_gemma":[0.0004895503,0.00003034356,0.00004529658,0.00001189439,0.000006926891,0.000008015253,0.00009880266,0.1605659,0.0442834,0.7935989,0.0005845181,0.0002763622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003318396,0.0000362825,0.9666254,0.000152162,0.00006673445,0.0004149615,0.000004644524,0.000264667,0.02911674],"genre_scores_gemma":[0.263922,0.000006099925,0.7350126,0.00005052525,0.00008847852,0.0001329124,0.00001535372,0.00003217613,0.0007398836],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2606036,"threshold_uncertainty_score":0.6881832,"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."}}