{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000373517,0.0001167735,0.0002348117,0.00008205764,0.00009230262,0.0001507967,0.0004594396,0.00006725991,0.00000992289],"category_scores_gemma":[0.000075262,0.000111955,0.00005969571,0.0001771214,0.00001216621,0.0002624426,0.0001196877,0.00008703003,0.00009599511],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007486797,"about_ca_system_score_gemma":0.00002951517,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005273711,"about_ca_topic_score_gemma":0.00001208672,"domain_scores_codex":[0.9987929,0.0000623734,0.0002450107,0.0003000764,0.0002844767,0.00031514],"domain_scores_gemma":[0.999029,0.0001324862,0.00009489222,0.0003349441,0.0002489081,0.0001598005],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003879709,0.02081389,0.01171533,0.001057655,0.007818068,0.0002515139,0.03749776,0.002087526,0.1030079,0.1561556,0.4203787,0.2388281],"study_design_scores_gemma":[0.0008988029,0.0002031509,0.000109767,0.00006848317,0.00001900403,0.000006416784,0.0000444175,0.9864751,0.003293462,0.00208596,0.006602642,0.0001928445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09951149,0.00007416234,0.8975325,0.0003734478,0.0006178857,0.0005167921,0.00001186694,0.0002935426,0.001068301],"genre_scores_gemma":[0.8990223,0.000002574764,0.0985515,0.0005390927,0.0006022684,0.0001252424,0.00003850368,0.00002159619,0.001096963],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9843875,"threshold_uncertainty_score":0.4565391,"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."}}