{"id":"W1813313303","doi":"10.1137/100793529","title":"A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs","year":2012,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Longest path problem; Combinatorics; Mathematics; Lexicographical order; Discrete mathematics; Time complexity; Induced path; Hamiltonian path; Graph; Shortest path problem","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.0005622272,0.00147012,0.001345924,0.001197294,0.001220319,0.001728583,0.002408461,0.001813473,0.01574604],"category_scores_gemma":[0.003715264,0.0006251137,0.001537883,0.002639159,0.0009695769,0.00408162,0.002596783,0.002663677,0.003707059],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002436363,"about_ca_system_score_gemma":0.00271336,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007254195,"about_ca_topic_score_gemma":0.008621378,"domain_scores_codex":[0.9986203,0.0001731971,0.00006962575,0.0005848096,0.0002557313,0.0002963988],"domain_scores_gemma":[0.9983441,0.0009254245,0.0001266761,0.0003583375,0.0001614144,0.00008411998],"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.0006067408,0.0006807811,0.00150064,0.0009760326,0.0001458361,0.0003240012,0.0007199144,0.1304825,0.01783871,0.1538407,0.06121568,0.6316684],"study_design_scores_gemma":[0.0003665446,0.0002448063,0.00068859,0.00006800418,0.00008922287,0.0004794775,0.000298894,0.6788419,0.008714265,0.2791166,0.03103041,0.00006133772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03347819,0.000573075,0.9370495,0.001417399,0.0001318478,0.0005030171,0.0008922553,0.006658675,0.01929592],"genre_scores_gemma":[0.209528,0.0004546735,0.7742388,0.0003823388,0.0001335816,0.0005079497,0.003298484,0.0009484551,0.0105077],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01574604,"threshold_uncertainty_score":0.05267572,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03762119088775073,"score_gpt":0.3278538762090636,"score_spread":0.2902326853213129,"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."}}