{"id":"W1507587294","doi":"10.1007/978-3-642-02011-7_12","title":"A Heuristic Strong Connectivity Algorithm for Large Graphs","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Algorithm; Hopcroft–Karp algorithm; Heuristic; Undirected graph; Graph; Theoretical computer science; Pathwidth; Line graph; Artificial intelligence","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001260539,0.0005650963,0.0006348636,0.000889711,0.0004486607,0.0005591058,0.002858873,0.0003430354,0.000005718423],"category_scores_gemma":[0.0001283718,0.0005548521,0.0002227608,0.0005860227,0.00024391,0.0004446556,0.0007413676,0.0006416909,0.000008239911],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002270194,"about_ca_system_score_gemma":0.0004255137,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008149666,"about_ca_topic_score_gemma":0.0000175127,"domain_scores_codex":[0.9962148,0.00004604451,0.0005181861,0.00166624,0.000690433,0.000864298],"domain_scores_gemma":[0.9971935,0.0006561379,0.0003481331,0.001232936,0.0003890224,0.0001802943],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002516839,0.00004641289,0.00000629235,0.00001618276,0.000008553511,0.00002164293,0.0001312298,0.01450172,0.000004196268,0.0757331,0.00008485407,0.9094433],"study_design_scores_gemma":[0.0002707263,0.0002307866,0.00002428033,0.000146389,0.000005937931,0.00002551875,3.659124e-8,0.7200524,0.0002177739,0.2770939,0.001458091,0.0004742509],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000003470755,0.0003614408,0.9950789,0.0003144444,0.000895792,0.0006959246,0.00002071826,0.0006413016,0.001988019],"genre_scores_gemma":[0.01962166,0.00003772543,0.9786019,0.001080603,0.0002712863,0.00001928049,0.00001274728,0.00003198229,0.0003227886],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.908969,"threshold_uncertainty_score":0.9996903,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01628712586283387,"score_gpt":0.2659755662070802,"score_spread":0.2496884403442464,"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."}}