{"id":"W2068790848","doi":"10.1007/s00454-007-9019-9","title":"Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D","year":2007,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Army Research Office; Tel Aviv University; Deutsche Forschungsgemeinschaft; Deutscher Akademischer Austauschdienst; National Science Foundation","keywords":"Spanning tree; Combinatorics; Minimum spanning tree; Euclidean geometry; Mathematics; Euclidean minimum spanning tree; Planar graph; Graph; Euclidean space; k-minimum spanning tree; Planar; Path (computing); Steiner tree problem; Discrete mathematics; Minimum degree spanning tree; Computer science; Tree structure; Binary tree; Geometry","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.0005595618,0.0006774379,0.000797055,0.002038137,0.0004682817,0.001178919,0.001023285,0.0008816889,0.002076579],"category_scores_gemma":[0.005971759,0.0005417665,0.000459059,0.001365862,0.0006316837,0.002069097,0.0008910809,0.000501873,0.0002888283],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006102461,"about_ca_system_score_gemma":0.0004648146,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005867352,"about_ca_topic_score_gemma":0.01087806,"domain_scores_codex":[0.9996642,0.00006789839,0.00002232706,0.00007306601,0.0001253589,0.00004719098],"domain_scores_gemma":[0.9981614,0.00128668,0.0001637082,0.0001133575,0.0001481732,0.0001267093],"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.00095147,0.0001457079,0.01568652,0.0002297773,0.0001129085,0.0002553884,0.0003485836,0.7828592,0.009414848,0.02165491,0.001892438,0.1664483],"study_design_scores_gemma":[0.00001442212,0.00003204151,0.001203479,0.00000513395,0.000009168873,0.00005643074,0.0000674913,0.9890172,0.001713209,0.007556044,0.0003164794,0.000008861649],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.820177,0.0004495315,0.1748197,0.0001590038,0.00002329092,0.0000370017,0.0004444778,0.000960421,0.002929708],"genre_scores_gemma":[0.8951337,0.0001887698,0.1027153,0.00002024002,0.00001195434,0.00002760367,0.00059139,0.0001766706,0.001134294],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005867352,"threshold_uncertainty_score":0.01166642,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01198783087499152,"score_gpt":0.2639476584860729,"score_spread":0.2519598276110814,"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."}}