{"id":"W7043540244","doi":"","title":"Succinct Data Structures for Chordal Graphs","year":2019,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"University of Waterloo","keywords":"Chordal graph; Interval graph; Neighbourhood (mathematics); Shortest path problem; Vertex (graph theory); Distance; Longest path problem; Graph; Induced path","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001602034,0.0009258135,0.001223931,0.00153445,0.001294731,0.003363716,0.003404122,0.001339103,0.007692968],"category_scores_gemma":[0.01210556,0.000775863,0.0009349416,0.004421473,0.001534368,0.01398244,0.003206644,0.002528937,0.001615171],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003252048,"about_ca_system_score_gemma":0.0019972,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002262593,"about_ca_topic_score_gemma":0.003278871,"domain_scores_codex":[0.997104,0.0004764167,0.0003684499,0.0005113384,0.001262884,0.0002768148],"domain_scores_gemma":[0.9884216,0.004214583,0.0009814845,0.004956078,0.001122636,0.0003035895],"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.001909193,0.0005747386,0.00357496,0.001590793,0.0001256561,0.0002453259,0.001072744,0.134455,0.02524712,0.4437521,0.0482504,0.3392018],"study_design_scores_gemma":[0.0002772211,0.0004102447,0.0007193812,0.0002183181,0.00008503655,0.0004116729,0.0005233539,0.3532483,0.03222376,0.5692791,0.04249619,0.0001075621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08123839,0.002243917,0.8909946,0.003487458,0.0003342608,0.0004560401,0.006730555,0.006034344,0.008480541],"genre_scores_gemma":[0.4710863,0.002003654,0.5053106,0.001030209,0.0003104679,0.0007708895,0.0106958,0.0006542806,0.008137857],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007692968,"threshold_uncertainty_score":0.0257355,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02565113104192915,"score_gpt":0.2386570289104132,"score_spread":0.2130058978684841,"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."}}