{"id":"W2358407808","doi":"","title":"New Algorithms for Graph Coloring Problem","year":2004,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Graph coloring; Computer science; Heuristic; Algorithm; Graph; NP-complete; Time complexity; Theoretical computer science; Artificial intelligence","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001711008,0.00211766,0.001264215,0.002453886,0.001204694,0.002502545,0.002978976,0.001982631,0.006500216],"category_scores_gemma":[0.006943904,0.0007312702,0.001339869,0.003671813,0.001176858,0.004445696,0.002080574,0.004506542,0.002334422],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001653963,"about_ca_system_score_gemma":0.001549067,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002065238,"about_ca_topic_score_gemma":0.002490732,"domain_scores_codex":[0.9977348,0.0005607953,0.0001482807,0.0004700981,0.0008947986,0.0001912389],"domain_scores_gemma":[0.997738,0.001224096,0.0001489875,0.0003582911,0.0004366397,0.00009399537],"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.0001441461,0.0002656363,0.000393508,0.0007160674,0.0001092522,0.0001172972,0.0001651081,0.1329858,0.004313455,0.2734132,0.04117317,0.5462034],"study_design_scores_gemma":[0.0001988308,0.0001095196,0.0002004621,0.0001188069,0.00007052315,0.0003881441,0.00006364458,0.6188432,0.004086441,0.2718135,0.1040448,0.00006226021],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001376849,0.001536009,0.9888673,0.0004311825,0.0004868438,0.0001491158,0.0001190821,0.000805467,0.00622808],"genre_scores_gemma":[0.01935839,0.002113931,0.9722899,0.0003973195,0.0004970023,0.000467951,0.000511349,0.0002879327,0.004076227],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006500216,"threshold_uncertainty_score":0.02174538,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1018207318053253,"score_gpt":0.3821459175294481,"score_spread":0.2803251857241228,"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."}}