Finding cliques using few probes
© 2019 Wiley Periodicals, Inc. Consider algorithms with unbounded computation time that probe the entries of the adjacency matrix of an n vertex graph, and need to output a clique. We show that if the input graph is drawn at random from (Formula presented.) (and hence is likely to have a clique of s...
| প্রধান লেখক: | , , , , |
|---|---|
| অন্যান্য লেখক: | |
| বিন্যাস: | প্রবন্ধ |
| ভাষা: | English |
| প্রকাশিত: |
Wiley
2021
|
| অনলাইন ব্যবহার করুন: | https://hdl.handle.net/1721.1/136529 |