{"id":"W42843301","doi":"10.1007/978-3-642-25591-5_38","title":"Computational Study on Bidimensionality Theory Based Algorithm for Longest Path Problem","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Algorithm; Path (computing); Planar graph; Planar; Grid; Graph theory; Mathematics; Time complexity; Minor (academic); Computer science; Combinatorics; Graph; Discrete mathematics; Geometry","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.0009385461,0.0005895335,0.001156655,0.001274479,0.001395967,0.002493546,0.002697572,0.001060525,0.01204158],"category_scores_gemma":[0.006034989,0.0003370258,0.001135559,0.002461637,0.0009869325,0.004601696,0.001528144,0.001844463,0.0008481462],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001823074,"about_ca_system_score_gemma":0.002249951,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003081033,"about_ca_topic_score_gemma":0.002938164,"domain_scores_codex":[0.9988373,0.0003636679,0.00006385829,0.0002867728,0.0002872269,0.0001612582],"domain_scores_gemma":[0.9968075,0.002200803,0.0001510799,0.0003978324,0.0003145447,0.0001283501],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008185389,0.0006146995,0.003583553,0.000948793,0.000122538,0.0001935906,0.0004323217,0.2822999,0.005980514,0.4360763,0.02473882,0.2441904],"study_design_scores_gemma":[0.00008313065,0.0001643256,0.0005248887,0.00005182336,0.00005469656,0.000172359,0.0001565066,0.8223852,0.001519243,0.1702845,0.004577893,0.00002544906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1829694,0.002605413,0.7594919,0.002388521,0.0005042939,0.0003843886,0.0007751863,0.0009243811,0.04995656],"genre_scores_gemma":[0.4907917,0.001217268,0.4947864,0.0003241329,0.000267037,0.0004184487,0.001513326,0.0002049315,0.01047678],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01204158,"threshold_uncertainty_score":0.04028308,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03876495649129547,"score_gpt":0.3027215662326018,"score_spread":0.2639566097413064,"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."}}