{"id":"W2141938776","doi":"10.1109/icde.2008.4497498","title":"An Efficient Algorithm for Answering Graph Reachability Queries","year":2008,"lang":"en","type":"article","venue":"","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":114,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Reachability; Transitive reduction; Computer science; Directed acyclic graph; Directed graph; Transitive closure; Disjoint sets; Graph; Path (computing); Recursion (computer science); Node (physics); Combinatorics; Algorithm; Theoretical computer science; Discrete mathematics; Mathematics; Line graph; Programming language; Voltage graph","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.001477111,0.002419302,0.001356254,0.003156043,0.001706583,0.003474168,0.003630763,0.002853001,0.01788162],"category_scores_gemma":[0.006389374,0.001161323,0.002206046,0.003818259,0.0009835196,0.007328236,0.002890834,0.001993957,0.007805464],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00241418,"about_ca_system_score_gemma":0.00389169,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006640691,"about_ca_topic_score_gemma":0.01140834,"domain_scores_codex":[0.9974993,0.0004685113,0.0002491187,0.0008416748,0.0006228861,0.0003184894],"domain_scores_gemma":[0.9966626,0.001939065,0.00019187,0.0006276161,0.0004790375,0.00009983328],"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.0008975562,0.0008056268,0.002072705,0.001193709,0.0002000884,0.0003361877,0.0004912483,0.04500156,0.02353245,0.05552065,0.07131969,0.7986286],"study_design_scores_gemma":[0.0005707405,0.0002976929,0.0009107048,0.0001165293,0.0001541291,0.0006084993,0.0004901491,0.7687427,0.01829904,0.16384,0.04584845,0.0001214032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008445848,0.0005158212,0.953815,0.0008324115,0.0001119563,0.0007125743,0.002943896,0.0257745,0.00684788],"genre_scores_gemma":[0.07144063,0.0003081716,0.9142435,0.0004022663,0.00007452185,0.0006711059,0.007651062,0.0007903214,0.004418511],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01788162,"threshold_uncertainty_score":0.05982,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01958224782664616,"score_gpt":0.2629155023223645,"score_spread":0.2433332544957183,"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."}}