{"id":"W2174851824","doi":"10.1016/j.tcs.2012.01.035","title":"More efficient periodic traversal in anonymous undirected graphs","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Agence Nationale de la Recherche","keywords":"Tree traversal; Undirected graph; Combinatorics; Graph; Set (abstract data type); Node (physics); Computer science; Mathematics; Period length; Discrete mathematics; Time complexity; Integer (computer science); Binary logarithm; Algorithm","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.001097534,0.0004178855,0.0009583073,0.0009493311,0.0009943661,0.001742732,0.001498418,0.001009336,0.009746877],"category_scores_gemma":[0.006227811,0.0004256985,0.0006778377,0.001624857,0.0005696551,0.00366213,0.001456834,0.001121216,0.001096522],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001018125,"about_ca_system_score_gemma":0.001613381,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002903038,"about_ca_topic_score_gemma":0.007755416,"domain_scores_codex":[0.9989508,0.0002811776,0.00006488503,0.0002151889,0.000245764,0.0002420274],"domain_scores_gemma":[0.9959905,0.001480084,0.0002973611,0.001739074,0.0002729782,0.0002201092],"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.002080143,0.001242234,0.004767093,0.0006115383,0.0001391184,0.0008042407,0.000990949,0.2986069,0.03037436,0.3124501,0.03697817,0.3109553],"study_design_scores_gemma":[0.0002111408,0.0002046435,0.0007186049,0.00003637081,0.00006979903,0.0003405185,0.000264194,0.7839922,0.007293672,0.1974259,0.009407923,0.00003496376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5509335,0.0004992486,0.4127716,0.001635629,0.0002937469,0.000219797,0.001080495,0.003363808,0.02920206],"genre_scores_gemma":[0.7578777,0.0002088878,0.2265385,0.0002829818,0.00009862975,0.0001115738,0.001433988,0.0004637224,0.01298397],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009746877,"threshold_uncertainty_score":0.03260654,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01068565830296577,"score_gpt":0.2572362291670868,"score_spread":0.246550570864121,"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."}}