Spreadsheets in RDBMS for OLAP
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
An O(n2.75) algorithm for incremental topological ordering
ACM Transactions on Algorithms (TALG)
Voter insertion algorithms for FPGA designs using triple modular redundancy
Proceedings of the 18th annual ACM/SIGDA international symposium on Field programmable gate arrays
On commutativity based Edge Lean search
Annals of Mathematics and Artificial Intelligence
Communicating memory transactions
Proceedings of the 16th ACM symposium on Principles and practice of parallel programming
Symbolic computation of strongly connected components and fair cycles using saturation
Innovations in Systems and Software Engineering
Scaling XML query processing: distribution, localization and pruning
Distributed and Parallel Databases
Finding kernels or solving SAT
Journal of Discrete Algorithms
A novel layout decomposition algorithm for triple patterning lithography
Proceedings of the 49th Annual Design Automation Conference
Fault-tolerant complex event processing using customizable state machine-based operators
Proceedings of the 15th International Conference on Extending Database Technology
Uniqueness of linear factorizations into independent subspaces
Journal of Multivariate Analysis
Relaxing claims: coping with uncertainty while evaluating assumptions at run time
MODELS'12 Proceedings of the 15th international conference on Model Driven Engineering Languages and Systems
Using mixed node publication network graphs for analyzing success in interdisciplinary teams
AMT'12 Proceedings of the 8th international conference on Active Media Technology
Not Every Friend on a Social Network Can be Trusted: An Online Trust Indexing Algorithm
WI-IAT '12 Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 03
A flexible approach for considering interdependent security objectives in service composition
Proceedings of the 28th Annual ACM Symposium on Applied Computing
A component-based solution for reducible Markov regenerative processes
Performance Evaluation
An efficient layout decomposition approach for triple patterning lithography
Proceedings of the 50th Annual Design Automation Conference
Viewing functions as token sequences to highlight similarities in source code
Science of Computer Programming
G-Tries: a data structure for storing and finding subgraphs
Data Mining and Knowledge Discovery
Mining trajectories of moving dynamic spatio-temporal regions in sensor datasets
Data Mining and Knowledge Discovery
Libra: divide and conquer to verify forwarding tables in huge networks
NSDI'14 Proceedings of the 11th USENIX Conference on Networked Systems Design and Implementation
| Hi-index | 0.00 |
The value of depth-first search or "backtracking" as a technique for solving graph problems is illustrated by two examples. An algorithm for finding the biconnected components of an undirected graph and an improved version of an algorithm for finding the strongly connected components of a directed graph are presented. The space and time requirements of both algorithms are bounded by k1V + k2E + k3 for some constants k1, k2, and k3, where V is the number of vertices and E is the number of edges of the graph being examined.