{"id":"W2783589701","doi":"10.1016/j.disopt.2017.08.005","title":"A linear time algorithm for the <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml167\" display=\"inline\" overflow=\"scroll\" altimg=\"si167.gif\"><mml:mn>3</mml:mn></mml:math>-neighbour Travelling Salesman Problem on a Halin graph and extensions","year":2017,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Travelling salesman problem; Hamiltonian path; Algorithm; Graph; Discrete mathematics","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.001356882,0.002958268,0.001805323,0.001946853,0.001825326,0.003545457,0.004435689,0.003019403,0.06520268],"category_scores_gemma":[0.005974432,0.001154455,0.002618974,0.002612797,0.001275781,0.004899599,0.003816216,0.00367861,0.02332064],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003314408,"about_ca_system_score_gemma":0.005031351,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00787008,"about_ca_topic_score_gemma":0.01502641,"domain_scores_codex":[0.9981577,0.0002336277,0.000139448,0.0006983959,0.0004836153,0.0002873226],"domain_scores_gemma":[0.9971473,0.00157829,0.0001486669,0.0005544894,0.0003672116,0.0002040206],"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.0008871831,0.0009683013,0.0007970208,0.001012587,0.0001754696,0.0002930769,0.0004274353,0.08166296,0.008747185,0.08564517,0.1617558,0.6576279],"study_design_scores_gemma":[0.0009347809,0.0004041235,0.0007793652,0.0001447968,0.0001327162,0.0006459915,0.000376016,0.6558113,0.007240583,0.2814659,0.0519237,0.0001407563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006411565,0.00042933,0.9476553,0.001506316,0.0003785913,0.0007085226,0.001504561,0.01198616,0.02941965],"genre_scores_gemma":[0.06612011,0.000341984,0.8998302,0.0005054634,0.0002252055,0.001030184,0.004015265,0.001927299,0.0260043],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.06520268,"threshold_uncertainty_score":0.2181247,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02012742426041067,"score_gpt":0.2707476361752828,"score_spread":0.2506202119148722,"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."}}