{"id":"W4411973470","doi":"10.1007/s10878-025-01332-0","title":"Algorithms for 2-balanced connected k-partition problem in graphs","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Theory of computation; Partition (number theory); Combinatorics; Computer science; Mathematics; Partition problem; Discrete mathematics; Algorithm","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.001964515,0.002342203,0.002350238,0.002062236,0.002006474,0.004883243,0.005275288,0.003636987,0.01889047],"category_scores_gemma":[0.009758943,0.001334506,0.001431011,0.003127614,0.001449083,0.009201216,0.004638545,0.002999171,0.002925456],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002291751,"about_ca_system_score_gemma":0.002728617,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005069579,"about_ca_topic_score_gemma":0.00744905,"domain_scores_codex":[0.9983566,0.0005085162,0.00008143376,0.0004390808,0.0002555388,0.0003587571],"domain_scores_gemma":[0.9948592,0.003306441,0.0004278821,0.0006356059,0.0003536242,0.0004172585],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00259975,0.001344459,0.003424776,0.001363579,0.0002670852,0.0002293914,0.0009916236,0.4850998,0.006069776,0.1060943,0.04627808,0.3462374],"study_design_scores_gemma":[0.0004351434,0.0001303612,0.0004732964,0.00008171541,0.00007309849,0.0001121689,0.0003360443,0.8292251,0.00168284,0.1641417,0.003279991,0.0000286544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1668412,0.001282558,0.7992106,0.003485262,0.0003258514,0.0009008679,0.002037166,0.002987255,0.02292931],"genre_scores_gemma":[0.4354943,0.0006562789,0.545841,0.000843351,0.0002583789,0.000899746,0.00428935,0.001011231,0.01070639],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01889047,"threshold_uncertainty_score":0.06319493,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01353589621227777,"score_gpt":0.3004663665176037,"score_spread":0.286930470305326,"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."}}