The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Nonconstructive tools for proving polynomial-time decidability
Journal of the ACM (JACM)
Some Matching Problems for Bipartite Graphs
Journal of the ACM (JACM)
A shortest-path algorithm with expected time O(n2 log n log* n)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
DOULION: counting triangles in massive graphs with a coin
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
SpamWatcher: a streaming social network analytic on the IBM wire-speed processor
Proceedings of the 5th ACM international conference on Distributed event-based system
Triangle listing in massive networks and its applications
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
ACM Transactions on Algorithms (TALG)
Triangle listing in massive networks
ACM Transactions on Knowledge Discovery from Data (TKDD) - Special Issue on the Best of SIGKDD 2011
Exact weight subgraphs and the k-sum conjecture
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |
Finding minimum circuits in graphs and digraphs is discussed. An almost minimum circuit is a circuit which may have only one edge more than the minimum. An 0(n2) algorithm is presented to find an almost minimum circuit. The straightforward algorithm for finding a minimum circuit has an 0(ne) behavior. It is refined to yield an 0(n2) average time algorithm. An alternative method is to reduce the problem of finding a minimum circuit to that of finding a triangle in an auxiliary graph. Three methods for finding a triangle in a graph are presented. The first has an 0(e3/2) worst case bound ((n) for planar graphs); the second takes 0(n5/3) time on the average; the third has an 0(nlog7) worst case behavior. For digraphs, recent results of Bloniarz, Fisher and Meyer are used to obtain an algorithm with 0(n2logn) average behavior.