Optimal algorithms for finding connected components of an unknown graph

  • Weiping Shi
  • Douglas B. West
Session 3A: Graph Algorithms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 959)


We want to find 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 SV, and the oracle tells us the vertices connected to S. We want to use the minimum number of queries, adaptively, to find the components. The problem is also known as interconnect diagnosis of wiring networks in VLSI. The graph has n vertices and k components, but k is not part of the input. We present a deterministic algorithm using O(min{k,log n}) queries and a randomized algorithm using expected O(min{k, log k+log log n}) queries. We also prove matching lower bounds.


Deterministic Algorithm Input Distribution Input Instance Active Interval Connection Relation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    C. C. Chen and F. Hwang. Detecting and locating electrical shorts using group testing. IEEE Trans. on Circuits and Systems 36 (8), pp. 1113–1116, Aug. 1989.CrossRefGoogle Scholar
  2. 2.
    W.-T. Cheng, J. L. Lewandowski and E. Wu. Optimal diagnostic methods for wiring interconnects. IEEE Trans. on Computer-Aided Design 11 (9), pp. 1161–1166, Sept. 1992.CrossRefGoogle Scholar
  3. 3.
    A. Fiat, D. P. Foster, H. Karloff, Y. Rabani, Y. Ravid, and S. Vishwanathan. Competitive algorithms for layered graph traversal. FOCS, pp. 288–297, 1991.Google Scholar
  4. 4.
    M. Garey, D. Johnson, and H. So. An application of graph coloring to printed circuit testing. IEEE Trans. Circuits and Systems 23 (10), pp. 591–599, Oct. 1976.CrossRefGoogle Scholar
  5. 5.
    N. Jarwala and C. W. Yau. A new framework for analyzing test generation and diagnosis algorithms for wiring interconnect. Proc. International Testing Conference, pp. 63–70, 1989.Google Scholar
  6. 6.
    R. M. Karp. Probabilistic recurrence relations. J. of ACM 41 (6), Nov. 1994, pp. 1136–1150.CrossRefGoogle Scholar
  7. 7.
    W. H. Kautz. Testing for faults in wiring networks. IEEE Trans. on Computers, 23 (4), pp. 358–363, April 1973.Google Scholar
  8. 8.
    L. Kavraki, J.-C. Latombe, R. Motwani and P. Raghavan. Randomized query processing in robot motion planning. STOC, 1995.Google Scholar
  9. 9.
    W. Shi and W. K. Fuchs. Optimal interconnect diagnosis of wiring networks. To appear IEEE Trans. on VLSI Systems, Sept. 1995.Google Scholar
  10. 10.
    A. Yao, Probabilistic Computations: Towards a Unified Measure of Complexity. Proc. FOCS, pp. 222–227, 1977.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Weiping Shi
    • 1
  • Douglas B. West
    • 2
  1. 1.Department of Computer ScienceUniversity of North TexasDentonUSA
  2. 2.Department of MathematicsUniversity of Illinois at Urbana-ChampaignUrbanaUSA

Personalised recommendations