{"id":"W2345365639","doi":"","title":"Algorithmic complexity and extremality characterizations for edge searching and its variations","year":2008,"lang":"en","type":"dissertation","venue":"Memorial University Research Repository (Memorial University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Bipartite graph; Combinatorics; Pathwidth; Search problem; Monotone polygon; Mathematics; Graph; Combinatorial search; Theoretical computer science; Time complexity; Computer science; Search algorithm; Beam search; Algorithm; Line graph","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.003210187,0.001299839,0.001910508,0.003136047,0.001711733,0.006144271,0.003884556,0.003069433,0.006508051],"category_scores_gemma":[0.02737124,0.001072112,0.003280764,0.004035543,0.004516215,0.01206037,0.004268984,0.006773439,0.0005205907],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003804903,"about_ca_system_score_gemma":0.001331818,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001393453,"about_ca_topic_score_gemma":0.00159236,"domain_scores_codex":[0.9951297,0.001415725,0.0003110297,0.001294248,0.001007869,0.0008414129],"domain_scores_gemma":[0.9590338,0.03166787,0.003220554,0.003086046,0.0014538,0.001538017],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004005561,0.0002898702,0.00602273,0.0004004068,0.0001587599,0.0002089684,0.0005231181,0.1065751,0.003320143,0.851585,0.004785869,0.02572952],"study_design_scores_gemma":[0.00006309345,0.00008613011,0.001675657,0.00005250047,0.0001061641,0.0002476806,0.0001620137,0.2857611,0.001228391,0.7082041,0.002358626,0.00005453144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.4576765,0.002079537,0.4877887,0.005063601,0.0001358757,0.0003235947,0.001352885,0.0005607405,0.04501861],"genre_scores_gemma":[0.8660067,0.001549748,0.1197112,0.000672801,0.0004894258,0.0006279537,0.001682854,0.0003901285,0.008869226],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.006508051,"threshold_uncertainty_score":0.02760667,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06127392015488285,"score_gpt":0.3046367329276792,"score_spread":0.2433628127727964,"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."}}