Proceedings ArticleDOI
Depth-first search and linear graph algorithms
Robert E. Tarjan
- Vol. 1, Iss: 2, pp 114-121
TLDR
In this paper, an algorithm for finding the biconnected components of an undirected graph and an improved version of an algorithm to find the strongly connected components of a directed graph are presented.Abstract:
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.read more
Citations
More filters
Journal ArticleDOI
Co-Simulation: A Survey
TL;DR: The need for finding generic approaches for modular, stable, and accurate coupling of simulation units, as well as expressing the adaptations required to ensure that the coupling is correct, is identified.
Proceedings ArticleDOI
Libra: divide and conquer to verify forwarding tables in huge networks
Hongyi Zeng,Shidong Zhang,Fei Ye,Vimalkumar Jeyakumar,Mickey Ju,Junda Liu,Nick McKeown,Amin Vahdat +7 more
TL;DR: Libra is a new tool for verifying forwarding tables in very large networks that runs fast because it can exploit the scaling properties of MapReduce and can take an accurate snapshot of the forwarding state 99.9% of the time, and knows when the snapshot cannot be trusted.
Journal ArticleDOI
An IoT-based task scheduling optimization scheme considering the deadline and cost-aware scientific workflow for cloud computing
TL;DR: A deadline and cost-aware scheduling algorithm that minimizes the execution cost of a workflow under deadline constraints in the infrastructure as a service (IaaS) model and performs well compared to state-of-the-art algorithms is proposed.
Journal ArticleDOI
TrajCompressor : An Online Map-matching-based Trajectory Compression Framework Leveraging Vehicle Heading Direction and Change
TL;DR: A light-weighted yet efficient map matcher, namely, Spatial-Directional Matching (SD-Matching), to align the noisy and sparse GPS points upon the underlying road network, which fully explores the usage of vehicle heading direction collected from the GPS trajectory data.
Proceedings ArticleDOI
A novel layout decomposition algorithm for triple patterning lithography
TL;DR: A stitch-aware mask assignment algorithm, based on a heuristic that finds a mask assignment such that the conflicts among the features in the same mask are more likely to be resolved by inserting stitches, is proposed.
References
More filters
Journal ArticleDOI
Backtrack Programming
TL;DR: A widely used method of efftcient search is examined in detail and its scope and methods are formulated in their full generality.
Efficient algorithms for graph manipulation
TL;DR: Efficient algorithms are presented for partitioning a graph into connected components, biconnected components and simple paths.
Journal ArticleDOI
A transitive closure algorithm
TL;DR: An algorithm is given for computing the transitive closure of a directed graph in a time no greater than a1N1n+a2n2 for largen and the method uses aboutn2+n bits and 5n words of storage.