{"id":"W2763773774","doi":"10.1016/j.jcss.2015.06.011","title":"The complexity of minimum-length path decompositions","year":2015,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerstwo Edukacji i Nauki; Narodowe Centrum Nauki","keywords":"Mathematics; Combinatorics; Pathwidth; Discrete mathematics; Path (computing); Time complexity; Graph; Generalization; Longest path problem; Chordal graph; Line graph; Computer science","routes":{"ca_aff":true,"ca_fund":true,"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.001768094,0.001223269,0.001715644,0.001692544,0.001424532,0.006157373,0.002989523,0.002461731,0.01708309],"category_scores_gemma":[0.02175967,0.001242051,0.001666109,0.003340074,0.001598141,0.0103799,0.002916873,0.002719235,0.001854009],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002637746,"about_ca_system_score_gemma":0.002528401,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002871557,"about_ca_topic_score_gemma":0.004049383,"domain_scores_codex":[0.9975222,0.0006535302,0.0001801153,0.000495353,0.0007429951,0.0004057734],"domain_scores_gemma":[0.9752407,0.01924848,0.001626159,0.001918264,0.0009818145,0.0009845884],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002955353,0.0007673615,0.008339414,0.001897937,0.0003726337,0.0005734789,0.001339055,0.4626088,0.01776652,0.24374,0.04371301,0.2159263],"study_design_scores_gemma":[0.0002996507,0.000130015,0.001386998,0.00007174497,0.0001141034,0.0002919782,0.0004098722,0.4809095,0.002429196,0.5106809,0.003235761,0.00004033485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6998765,0.002182349,0.2431876,0.007859262,0.0002667372,0.0003996149,0.009384518,0.002023752,0.03481968],"genre_scores_gemma":[0.8538129,0.001524331,0.1261865,0.0004950874,0.0002950525,0.0003027783,0.007369727,0.0007927681,0.009220822],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01708309,"threshold_uncertainty_score":0.05714858,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08791787131458557,"score_gpt":0.3316694274632337,"score_spread":0.2437515561486482,"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."}}