Graphs Where Search Methods Are Indistinguishable
نویسندگان
چکیده
Graph searching is one of the simplest and most widely used tools in graph algorithms. Every search method defined using some particular selection rule, analysis corresponding vertex orderings can aid greatly devising algorithms, writing proofs correctness, or recognition various families.
منابع مشابه
Indistinguishable Trees and Graphs
We show that a number of graph invariants are, even combined, insufficient to distinguish between nonisomorphic trees or general graphs. Among these are: the spectrum of eigenvalues (equivalently, the characteristic polynomial), the number of independent sets of all sizes or the number of connected subgraphs of all sizes. We therefore extend the classical theorem of Schwenk that almost every tr...
متن کاملReflection for the undergraduate on writing in the portfolio: where are we now and where are we going?
Introduction: The portfolio can be seen as a tool for assessmentof a variety of learning activities that differ in content, usage, andassessment. The portfolio not only meets the learner’s educationalneeds but also the political and public reassurance demand thatthe health professional has achieved the required competency ofthe curriculum that allows him or her to practice safely with orwithout...
متن کاملSearch Methods Used to Locate Missing Cats and Locations Where Missing Cats Are Found
Missing pet cats are often not found by their owners, with many being euthanized at shelters. This study aimed to describe times that lost cats were missing for, search methods associated with their recovery, locations where found and distances travelled. A retrospective case series was conducted where self-selected participants whose cat had gone missing provided data in an online questionnair...
متن کاملSearch using queries on indistinguishable items
We investigate the problem of determining a set S of k indistinguishable integers in the range [1, n]. The algorithm is allowed to query an integer q ∈ [1, n], and receive a response comparing this integer to an integer randomly chosen from S. The algorithm has no control over which element of S the query q is compared to. We show tight bounds for this problem. In particular, we show that in th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Trends in mathematics
سال: 2021
ISSN: ['2297-024X', '2297-0215']
DOI: https://doi.org/10.1007/978-3-030-83823-2_55