A probabilistic upper bound for the edge identification complexity of graphs

DOI10.1016/0012-365X(94)90178-3MaRDI QIDQ1322293zbMATHOpenAlexFDO

Authors Eberhard Triesch

Publication date 5 May 1994

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(94)90178-3

zbMATH Keywords

random graphedge identification complexity

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On the time to identify the nodes in a random graph
• On the complexity of the identifiable subgraph problem
• On the complexity of the identifiable subgraph problem, revisited
• Edge and pair queries-random graphs and complexity
• A note on the asymptotic and computational complexity of graph distinguishability
• An optimal lower bound on the number of variables for graph identification
• scientific article; zbMATH DE number 3889547
• The complexity of \(L(p, q)\)-edge-labelling
• The complexity of \(L(p, q)\)-edge-labelling
• The d-Identifying Codes Problem for Vertex Identification in Graphs: Probabilistic Analysis and an Approximation Algorithm

Cites work

• scientific article; zbMATH DE number 3904630 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Cliques in random graphs

Cited in

(6)

• An NP-completeness result of edge search in graphs
• Optimal identification of sets of edges using 2-factors
• An optimal lower bound on the number of variables for graph identification
• On a group testing problem: characterization of graphs with 2-complexity and maximum number of edges
• Searching for an edge in a graph with restricted test sets
• Edge search in graphs with restricted test sets

This page was built for publication: A probabilistic upper bound for the edge identification complexity of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1322293)