{"id":"W1996212671","doi":"10.1109/icc.2012.6363762","title":"Carving-decomposition based algorithms for the maximum path coloring problem","year":2012,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Cardinality (data modeling); Path (computing); Approximation algorithm; Disjoint sets; Mathematics; Algorithm; Computer science; Discrete mathematics; Graph; Database","routes":{"ca_aff":true,"ca_fund":false,"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.001260099,0.001934981,0.001536616,0.001573983,0.001228785,0.001992817,0.002759565,0.001553512,0.007932814],"category_scores_gemma":[0.003849888,0.001059683,0.001743277,0.002632014,0.001074984,0.003673111,0.002668377,0.002822709,0.00173851],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003131498,"about_ca_system_score_gemma":0.003336439,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007591673,"about_ca_topic_score_gemma":0.009341992,"domain_scores_codex":[0.998273,0.0003783427,0.00007922288,0.0004170922,0.0004471952,0.0004051025],"domain_scores_gemma":[0.9984173,0.0007305527,0.0001255886,0.0003735642,0.0002393664,0.0001137464],"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.0004533317,0.0004668508,0.0008643666,0.0003888474,0.00009725149,0.0001001725,0.0003140254,0.5638645,0.005130325,0.0947219,0.02299751,0.3106009],"study_design_scores_gemma":[0.00009560942,0.00005180294,0.0001330481,0.0000281583,0.00002267994,0.00007903119,0.00006287824,0.9332422,0.0016934,0.05929495,0.005277728,0.00001842966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02077061,0.0008187239,0.965515,0.0004655961,0.00008544848,0.0002253327,0.0003028114,0.00234831,0.009468107],"genre_scores_gemma":[0.1351171,0.0005568425,0.8576806,0.00026432,0.00006557338,0.0003769573,0.001459482,0.0005253283,0.003953901],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007932814,"threshold_uncertainty_score":0.0265379,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04160270630932097,"score_gpt":0.3298041118872781,"score_spread":0.2882014055779571,"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."}}