{"id":"W1496800439","doi":"10.1007/978-3-642-16926-7_24","title":"From Path Graphs to Directed Path Graphs","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Longest path problem; Induced path; Path (computing); Computer science; Block graph; Cograph; Combinatorics; Directed graph; Fast path; Induced subgraph isomorphism problem; Indifference graph; Pathwidth; Discrete mathematics; Mathematics; Algorithm; Graph; Chordal graph; Shortest path problem; Line graph; Voltage graph; Computer network","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.0003809931,0.001089086,0.0005270361,0.002155659,0.0007611543,0.002234648,0.001492456,0.0009733193,0.01787814],"category_scores_gemma":[0.003134319,0.0008116413,0.0008270544,0.003640294,0.001659207,0.007116562,0.001875748,0.002829751,0.004274144],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001126136,"about_ca_system_score_gemma":0.0005048309,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001625577,"about_ca_topic_score_gemma":0.001751403,"domain_scores_codex":[0.9995663,0.0001060566,0.00002527684,0.000133281,0.0001345099,0.00003461267],"domain_scores_gemma":[0.9989931,0.0006126496,0.00004894195,0.0001556047,0.0001420434,0.00004763972],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001211222,0.00001432495,0.00008066689,0.0002960885,0.00001097225,0.00009127655,0.000243655,0.003116308,0.0007070375,0.8665124,0.02457874,0.1043364],"study_design_scores_gemma":[0.000002598155,0.000003983874,0.00003935799,0.00004088725,0.000005408548,0.00008015029,0.00003453796,0.002234181,0.0001885661,0.9510772,0.04628826,0.000004893015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006471395,0.009769414,0.8389265,0.002092414,0.001248701,0.000100141,0.001243415,0.001908162,0.13824],"genre_scores_gemma":[0.1586949,0.0296537,0.7018999,0.002700764,0.001824543,0.0004833414,0.004070494,0.002909265,0.09776307],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01787814,"threshold_uncertainty_score":0.05980837,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01537919343013408,"score_gpt":0.2671553684197118,"score_spread":0.2517761749895777,"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."}}