{"id":"W1988889787","doi":"10.1007/s00453-006-0074-2","title":"Deterministic Rendezvous in Graphs","year":2006,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":179,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Rendezvous; Computer science; Theory of computation; Time complexity; Binary logarithm; Graph; Identifier; Upper and lower bounds; Node (physics); Combinatorics; Mathematics; Discrete mathematics; Algorithm; Theoretical computer science; Computer network","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.001452821,0.000985904,0.001994446,0.001426419,0.002780602,0.003282903,0.003040523,0.002434256,0.009044521],"category_scores_gemma":[0.01273242,0.001289191,0.001119511,0.002264237,0.004251047,0.006404631,0.003677689,0.002654053,0.001082439],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002329163,"about_ca_system_score_gemma":0.001522697,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006154896,"about_ca_topic_score_gemma":0.007691697,"domain_scores_codex":[0.9983359,0.0005649762,0.00006518399,0.0004580183,0.0002550575,0.0003208701],"domain_scores_gemma":[0.9909333,0.006552436,0.0006041919,0.001037707,0.0003377384,0.0005346468],"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.0005716782,0.0001076684,0.001153391,0.0003161156,0.0001044,0.0002245691,0.0006130697,0.3057693,0.001924651,0.6487612,0.007769501,0.03268446],"study_design_scores_gemma":[0.00009859689,0.00003449892,0.0002158011,0.00003426232,0.00003711797,0.00009368231,0.0002160379,0.2950231,0.001242269,0.6996757,0.003305989,0.00002299522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4227057,0.002419023,0.5222675,0.004065999,0.0002263105,0.0002390178,0.0008096251,0.001232831,0.046034],"genre_scores_gemma":[0.9064116,0.0009107147,0.07177787,0.0002537952,0.00008441443,0.0001862,0.0004800956,0.0004122666,0.01948304],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009044521,"threshold_uncertainty_score":0.03025699,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00716953051749322,"score_gpt":0.2238464719368621,"score_spread":0.2166769414193689,"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."}}