{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001207677,0.001650444,0.00139833,0.002344542,0.001489812,0.001446943,0.00356903,0.001723427,0.01403943],"category_scores_gemma":[0.005577602,0.001142827,0.001098579,0.002839384,0.001215978,0.003208576,0.003026475,0.001844745,0.00179668],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001214655,"about_ca_system_score_gemma":0.002263485,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003277427,"about_ca_topic_score_gemma":0.006678288,"domain_scores_codex":[0.9992293,0.0002196733,0.00003723122,0.000158551,0.0002441803,0.0001109998],"domain_scores_gemma":[0.996592,0.001933058,0.0002087601,0.0006234166,0.0004146167,0.00022819],"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.000748323,0.0004305825,0.001200432,0.0005739562,0.0001342786,0.0002027466,0.0002201563,0.3050756,0.008806925,0.06143874,0.02443271,0.5967356],"study_design_scores_gemma":[0.0002978939,0.0001713549,0.0004238523,0.00004010426,0.00007107,0.000127253,0.00007081081,0.9272857,0.002892141,0.06303388,0.005560133,0.00002576932],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03543859,0.0005473198,0.9501195,0.0006396914,0.0001656854,0.000424695,0.0003690412,0.002541679,0.009753836],"genre_scores_gemma":[0.1463612,0.0002699548,0.8438617,0.0002733215,0.0001662771,0.0006165406,0.001139898,0.0005055849,0.006805638],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01403943,"threshold_uncertainty_score":0.04696655,"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."}}