{"id":"W1977507713","doi":"10.1007/s10878-007-9106-0","title":"Lower bounds and a tabu search algorithm for the minimum deficiency problem","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Theory of computation; Tabu search; Graph; Graph coloring; Edge coloring; Neighbourhood (mathematics); Discrete mathematics; Algorithm; Graph power; 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.003474045,0.0001068686,0.000166639,0.000229414,0.0003153585,0.0002452709,0.0006810096,0.00007004115,0.00000415566],"category_scores_gemma":[0.0001889387,0.00007456545,0.00008202333,0.0006460372,0.000121482,0.0007537701,0.0001321162,0.0002466261,6.244306e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007122348,"about_ca_system_score_gemma":0.0001691695,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001495625,"about_ca_topic_score_gemma":1.802376e-7,"domain_scores_codex":[0.9983963,0.000081684,0.0004218218,0.0001631586,0.0006101715,0.0003268829],"domain_scores_gemma":[0.9976555,0.0008122514,0.0002459275,0.0002207464,0.000942103,0.0001235404],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006531384,0.0006683498,0.0001788569,0.00005027065,0.0001000687,0.00004910632,0.001859062,0.120255,0.000640075,0.5657966,0.0007672138,0.3089823],"study_design_scores_gemma":[0.003599077,0.001933584,0.0001230925,0.00004305712,0.00002771425,0.0001552817,0.000162938,0.861908,0.001145847,0.1279197,0.002754105,0.0002275815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001087805,0.0004615418,0.9954109,0.000511304,0.001969013,0.00034713,9.737748e-7,0.00001521424,0.0001960759],"genre_scores_gemma":[0.1232305,0.0001771646,0.8759038,0.00006560211,0.0004978231,0.00000744214,8.120082e-7,0.00001981386,0.00009699572],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.741653,"threshold_uncertainty_score":0.3040691,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01375133543579926,"score_gpt":0.2907933059047155,"score_spread":0.2770419704689163,"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."}}