scientific article
From MaRDI portal
Publication:3994535
zbMath0663.68076MaRDI QIDQ3994535
Publication date: 17 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Partial orders, general (06A06) Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Graph theory (05C99)
Related Items
On polychotomous search problems, An empirical analysis of terminological representation systems, On binary search trees, A ternary search problem on two disjoint sets, Enclosing \(k\) points in the smallest axis parallel rectangle, Improved algorithms for group testing with inhibitors, Realizability and uniqueness in graphs, Search problems: One, two or many rounds, On the tree search problem with non-uniform costs, A group testing problem for graphs with several defective edges, \(Q\)-ary search with one Lie and bi-interval queries, New lower bounds on the cost of binary search trees, Exact learning from an honest teacher that answers membership queries, Optimal detection of a counterfeit coin with multi-arms balances, Selecting two different defective coins, Searching for acyclic orientations of graphs, Edge search in hypergraphs, Learning Boolean halfspaces with small weights from membership queries, A nonadaptive version of Ulam's problem with one lie, A non-adaptive search algorithm that identifies up to three defects, A competitive algorithm in searching for many edges in a hypergraph, A group testing problem for hypergraphs of bounded rank, Two new perspectives on multi-stage group testing, Rounds in combinatorial search, Geometric Applications of Posets, On graphs that contain exactly \(k\) copies of a subgraph, and a related problem in search theory, On a group testing problem: characterization of graphs with 2-complexity and maximum number of edges, Minimum average-case queries of \(q+1\)-ary search game with small sets, Searching for faulty leaves in binary trees, Upper and lower bounds for competitive group testing, Variants of the majority problem., Recognition problems and communication complexity., Linear extension majority cycles for small (n\(\leq 9)\) partial orders, Optimal detection of two counterfeit coins with two-arms balance., Some results on the complexity of families of sets, Learning a hidden graph, Reconstruction and verification of chordal graphs with a distance oracle, Protocol completion incentive problems in cryptographic Vickrey auctions, A binary search problem on graphs, Finding the maximum and minimum, An improved algorithm for quantitative group testing, Learning a hidden uniform hypergraph, Search When the Lie Depends on the Target, Computing majority with triple queries, Minimax trees in linear time with applications, Finding at least one excellent element in two rounds, On searching strategies, parallel questions, and delayed answers, Optimal binary search trees, An NP-completeness result of edge search in graphs, The plurality problem with three colors and more., Counting linear extension majority cycles in partially ordered sets on up to 13 elements, On optimal randomized group testing with one defective item and a constrained number of positive responses, Reconstruction of hidden graphs and threshold group testing, Binary trees with choosable edge lengths, Optimal query complexity bounds for finding graphs, Minimal average cost of searching for a counterfeit coin: restricted model, Searching for a counterfeit coin with \(b\)-balance, A combinatorial search problem on matroids, Optimal search procedure on coin-weighing problem, Least adaptive optimal search with unreliable tests, A Combinatorial Model of Two-Sided Search, Minimum number of queries for an adaptive liar search game with small sets, Unnamed Item, Edge search in graphs and hypergraphs of bounded rank, Binary search with delayed and missing answers, Group testing with unreliable tests, A predetermined algorithm for detecting a counterfeit coin with a multi-arms balance, Rounds in a combinatorial search problem, Searching for an edge in a graph with restricted test sets, Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z}\)], A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem, Nonadaptive algorithms for threshold group testing, Geometric applications of posets, Disjoint Spread Systems and Fault Location, Toward a deterministic polynomial time algorithm with optimal additive query complexity, A revised algorithm for searching for all defective edges in a graph, Reconstructing Weighted Graphs with Minimal Query Complexity, Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping, Searching in trees, The Rivest-Vuillemin conjecture on monotone Boolean functions is true for ten variables, Searching for a counterfeit coin with two unreliable weighings, Edge search in graphs with restricted test sets, On Parity Check (0,1)-Matrix over $\mathbb{Z}_p$, Searching for two counterfeit coins with two-arms balance, Monotonicity checking, Polynomial-time quantum algorithms for finding the linear structures of Boolean function, Unnamed Item
