{"id":"W2920974405","doi":"10.1007/s10878-019-00400-6","title":"A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs","year":2019,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Neighbourhood (mathematics); Vertex connectivity; Connectivity; Graph; Time complexity; Theory of computation; 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.0005993067,0.0009294088,0.001073635,0.001832969,0.001255351,0.00200486,0.00265871,0.001431431,0.01036315],"category_scores_gemma":[0.005441241,0.0006657045,0.0009722169,0.002499345,0.0009324454,0.002384121,0.001755952,0.001263881,0.00145664],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001755503,"about_ca_system_score_gemma":0.003259068,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008002302,"about_ca_topic_score_gemma":0.0128688,"domain_scores_codex":[0.9992629,0.0001555133,0.00004110355,0.0002441671,0.0001385456,0.0001578641],"domain_scores_gemma":[0.9954788,0.002969144,0.0003629117,0.0005780803,0.0003803353,0.0002307786],"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.00200919,0.0009323899,0.007902224,0.0007891695,0.0002372049,0.0005252197,0.0007239548,0.3183107,0.03238898,0.05733981,0.03079179,0.5480494],"study_design_scores_gemma":[0.0003340098,0.0002620513,0.00146321,0.00003984049,0.00007813888,0.0001615324,0.0002723899,0.916262,0.007666007,0.06953415,0.003887899,0.00003869129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4362527,0.0004776067,0.5317162,0.001092217,0.0001335665,0.0006718397,0.001962651,0.004337995,0.02335517],"genre_scores_gemma":[0.610814,0.0002178402,0.3782787,0.0002343046,0.00009740052,0.0002828171,0.003974466,0.0004273106,0.0056731],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01036315,"threshold_uncertainty_score":0.03466821,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005635936552762238,"score_gpt":0.2127651921359911,"score_spread":0.2071292555832289,"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."}}