Graph-Theoretic Concepts in Computer Science

DOI10.1007/11604686zbMath1126.68514MaRDI QIDQ5897540

Mathilde Bouvel, Gregory Kucherov, Vladimir Grebinski

Publication date: 1 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Genetics and epigenetics (92D10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

Exact learning from an honest teacher that answers membership queries, Linear Time Constructions of Some $$d$$-Restriction Problems, Unnamed Item, Reconstructing weighted graphs with minimal query complexity, Reconstructing Markov processes from independent and anonymous experiments, Non-adaptive learning of a hidden hypergraph, Learning and Verifying Graphs Using Queries with a Focus on Edge Counting, Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions, Learning a hidden graph, Learning a hidden uniform hypergraph, Reconstruction of hidden graphs and threshold group testing, Optimal query complexity bounds for finding graphs, Finding hidden hubs and dominating sets in sparse graphs by randomized neighborhood queries, Nonadaptive algorithms for threshold group testing, Toward a deterministic polynomial time algorithm with optimal additive query complexity, Reconstructing Weighted Graphs with Minimal Query Complexity, Non-adaptive Learning of a Hidden Hypergraph, On Parity Check (0,1)-Matrix over $\mathbb{Z}_p$