{"id":"W7511636","doi":"","title":"Algorithms For The Optimal Hamiltonian Path In Halin Graphs.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Hamiltonian path; Hamiltonian path problem; Path (computing); Combinatorics; Discrete mathematics; Graph; Computer science","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"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.001160677,0.001608826,0.001110302,0.002128663,0.0009704913,0.001657191,0.001778959,0.001926514,0.02273353],"category_scores_gemma":[0.005995309,0.0007299487,0.001075579,0.001657162,0.0008656902,0.002457621,0.00179449,0.001927228,0.003069406],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002056439,"about_ca_system_score_gemma":0.002695351,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006639717,"about_ca_topic_score_gemma":0.01474033,"domain_scores_codex":[0.9994463,0.0001783922,0.00002932636,0.0001624773,0.00008469183,0.00009874594],"domain_scores_gemma":[0.996954,0.002290923,0.0001772962,0.0002112319,0.0002372203,0.0001293825],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003849757,0.0002870492,0.001970477,0.0008262402,0.0001613822,0.0001768509,0.0003445415,0.5924568,0.001740564,0.07526331,0.03288053,0.2935073],"study_design_scores_gemma":[0.0001064111,0.00005842732,0.0002593524,0.00004851798,0.0000231151,0.00003952859,0.0001474976,0.8784677,0.0003415674,0.1149073,0.00559094,0.000009658973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02781518,0.001373616,0.9443204,0.002095193,0.0002655984,0.0006361776,0.002344033,0.004161475,0.01698826],"genre_scores_gemma":[0.2277727,0.0006556413,0.7476645,0.0005949223,0.0001451546,0.0009838041,0.005860804,0.001119768,0.01520273],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02273353,"threshold_uncertainty_score":0.07605129,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02096053234701034,"score_gpt":0.2545780518503076,"score_spread":0.2336175195032972,"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."}}