Structural Diagnosis of Wiring Networks: Finding Connected Components of Unknown Subgraphs
نویسندگان
چکیده
Given a graph G = (V, E), we want to find the vertex sets of the components of an unknown subgraph F = (V,E) of G, such that E ⊆ E. We learn about F by sending an oracle a query set S ⊆ V , and the oracle tells us the vertices connected to S in F . The objective is to use the minimum number of queries to partition the vertex set V into components of F . In electronic circuit design, the problem is also known as structural diagnosis of wiring networks.
منابع مشابه
Optimal Algorithms for Finding Connected Components of an Unknown Graph
We want to nd the connected components of an unknown graph G with a known vertex set V. We learn about G by sending an oracle a query set S V , and the oracle tells us the vertices connected to S. We want to use the minimum number of queries, adaptively, to nd the components. The problem is also known as interconnect diagnosis of wiring networks in VLSI. The graph has n vertices and k component...
متن کاملDiagnosis of Wiring Networks: An Optimal Randomized Algorithm for Finding Connected Components of Unknown Graphs
We want to find the vertex sets of components of a graph G with a known vertex set V and unknown edge set E. We learn about G by sending an oracle a query set S ⊆ V , and the oracle tells us the vertices connected to S. The objective is to use the minimum number of queries to partition the vertex set into components. The problem is also known as interconnect diagnosis of wiring networks in VLSI...
متن کاملComplexes Detection in Biological Networks via Diversified Dense Subgraphs Mining
Protein-protein interaction (PPI) networks, providing a comprehensive landscape of protein interacting patterns, enable us to explore biological processes and cellular components at multiple resolutions. For a biological process, a number of proteins need to work together to perform the job. Proteins densely interact with each other, forming large molecular machines or cellular building blocks....
متن کاملSearch of Weighted Subgraphs on Complex Networks with Maximum Likelihood Methods
Real-data networks often appear to have strong modularity, or network-of-networks structure, in which subgraphs of various size and consistency occur. Finding the respective subgraph structure is of great importance, in particular for understanding the dynamics on these networks. Here we study modular networks using generalized method of maximum likelihood. We first demonstrate how the method w...
متن کاملConnectivity in Real and Simulated Associative Memories
Finding efficient patterns of connectivity in sparse associative memories is a difficult problem. It is, however, one that real neuronal networks, such as the mammalian cortex, must have solved. We have investigated computational models of sparsely connected associative memories and found that some patterns of connectivity produce both good performance and efficient use of resources. This could...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Discrete Math.
دوره 14 شماره
صفحات -
تاریخ انتشار 2001