{"id":"W1927157310","doi":"10.1109/ipps.1992.223066","title":"Efficient parallel shortest path algorithms for k-chordal graphs","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Shortest path problem; Chordal graph; Product (mathematics); Combinatorics; Path (computing); Longest path problem; Parallel algorithm; Computer science; Binary logarithm; K shortest path routing; Algorithm; Floyd–Warshall algorithm; Mathematics; Discrete mathematics; 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.0003516529,0.0006958585,0.0005849668,0.001077963,0.001168018,0.001086168,0.001179114,0.0004977398,0.005419279],"category_scores_gemma":[0.00156535,0.0003348849,0.0005580149,0.002347467,0.0003763626,0.00201464,0.0009619994,0.0006945629,0.002204437],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001305132,"about_ca_system_score_gemma":0.001422728,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007630122,"about_ca_topic_score_gemma":0.01024942,"domain_scores_codex":[0.9994867,0.00006443109,0.00004320669,0.0001477937,0.0001804681,0.00007727426],"domain_scores_gemma":[0.9991703,0.0002403809,0.00004850323,0.0002079865,0.0002854755,0.00004740342],"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.0005318494,0.000318128,0.001153931,0.0004576199,0.00008599593,0.0001768012,0.0002484744,0.1650946,0.03056816,0.07162281,0.04252237,0.6872193],"study_design_scores_gemma":[0.000135944,0.000181768,0.000536597,0.0000327861,0.00004261706,0.0002563528,0.0002251309,0.8456151,0.02577354,0.07136162,0.05579959,0.00003899216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03970289,0.0008556781,0.9214673,0.0006479801,0.0003524605,0.0003280697,0.0006682953,0.004772951,0.03120429],"genre_scores_gemma":[0.1934792,0.0007008583,0.7850788,0.0001301881,0.000135703,0.0002860914,0.002244484,0.0004954911,0.01744922],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007630122,"threshold_uncertainty_score":0.01812929,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03269908696444551,"score_gpt":0.3084834023234436,"score_spread":0.2757843153589981,"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."}}