{"id":"W2101752896","doi":"10.1016/s0166-218x(02)00251-2","title":"Finding paths in graphs avoiding forbidden transitions","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Discrete mathematics; Graph; Graph isomorphism; Line 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.0005269294,0.0008085704,0.0008916855,0.001611469,0.001533161,0.001431171,0.001467239,0.001377283,0.004428999],"category_scores_gemma":[0.005622723,0.0009182465,0.0008987277,0.001795767,0.001190638,0.002815262,0.0016761,0.001718525,0.0004745106],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006762649,"about_ca_system_score_gemma":0.001148877,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00231793,"about_ca_topic_score_gemma":0.003665901,"domain_scores_codex":[0.9995828,0.00009165271,0.00002998511,0.0001345096,0.00006727515,0.00009364079],"domain_scores_gemma":[0.9933916,0.005202912,0.0005700132,0.0002844498,0.0002571398,0.0002939997],"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.004631109,0.001244788,0.02245241,0.00305497,0.0004444518,0.002315689,0.002854053,0.2808634,0.04127188,0.2435905,0.0155726,0.3817042],"study_design_scores_gemma":[0.0003995111,0.0005175245,0.002916728,0.0002300786,0.0002175898,0.0007539411,0.001294585,0.2988932,0.01609539,0.6729611,0.005666046,0.00005436946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7668735,0.0004346855,0.2210319,0.0007564525,0.0000746579,0.0003364949,0.001579147,0.001053976,0.007859282],"genre_scores_gemma":[0.7554616,0.0004678488,0.2349921,0.0001978887,0.00003187846,0.0002041038,0.002485634,0.000273809,0.005885173],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004428999,"threshold_uncertainty_score":0.01481652,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04135075435661177,"score_gpt":0.2841048643191326,"score_spread":0.2427541099625208,"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."}}