{"id":"W2215508553","doi":"10.1371/journal.pone.0136264","title":"A Simple Algorithm for Finding All k-Edge-Connected Components","year":2015,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Windsor","funders":"Natural Science Foundation of Hebei Province; Chinese Academy of Sciences; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Multigraph; Combinatorics; Biconnected graph; Bound graph; Graph power; Vertex (graph theory); Disjoint sets; Complement graph; Mathematics; Graph; Undirected graph; Time complexity; Discrete mathematics; Edge contraction; Directed graph; Computer science; Line graph","routes":{"ca_aff":true,"ca_fund":true,"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.0003901558,0.002207108,0.001272473,0.003082609,0.001488772,0.001641267,0.002479196,0.001343043,0.01961605],"category_scores_gemma":[0.002774317,0.0009015304,0.001203208,0.003517388,0.0007803448,0.002993186,0.002242472,0.001167024,0.007434489],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009854382,"about_ca_system_score_gemma":0.00269065,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003590939,"about_ca_topic_score_gemma":0.006470248,"domain_scores_codex":[0.9992313,0.00007217207,0.00007339633,0.0002886415,0.0002305763,0.0001038703],"domain_scores_gemma":[0.9990414,0.0002362252,0.00008457594,0.0002575656,0.0003213913,0.00005884677],"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.0004624653,0.0002857591,0.001506819,0.0007633545,0.0001398623,0.0003020407,0.0003848688,0.02582652,0.02116412,0.02891841,0.03648312,0.8837627],"study_design_scores_gemma":[0.0007453396,0.0005142206,0.003381797,0.0002663276,0.0003406015,0.002144468,0.0007664221,0.5591915,0.05882659,0.2130877,0.1604933,0.0002417229],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009409992,0.0003331323,0.9766297,0.0002997777,0.0001107235,0.0008072915,0.0009492419,0.005237672,0.006222354],"genre_scores_gemma":[0.03872035,0.0001803631,0.9531064,0.00009863177,0.00002205609,0.0004784459,0.002130618,0.0004606007,0.004802596],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01961605,"threshold_uncertainty_score":0.06562221,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1531515500051077,"score_gpt":0.2747877479918328,"score_spread":0.1216361979867251,"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."}}