منابع مشابه
Recognizing Unordered Depth-First Search Trees of an Undirected Graph in Parallel
ÐLet G be an undirected graph and T be a spanning tree of G. In this paper, an efficient parallel algorithm is proposed for determining whether T is an unordered depth-first search tree of G. The proposed algorithm runs in O m=p logm time using p processors on the EREW PRAM, where m is the number of edges contained in G. It is cost-optimal and achieves linear speedup. Index TermsÐDepth-first ...
متن کاملSearch Trees for Distributed Graph Transformation Systems
Graph transformation systems, like PROGRES and Fujaba, can be used for modeling software systems of various domains, and support the automatic generation of executable code. A graph transformation rule is executed only if the pattern of the transformation’s left-hand side is found in the graph. The search for the pattern has an exponential worst-case complexity. In many cases, the average compl...
متن کاملRecognizing Cartesian graph bundles
Graph bundles generalize the notion of covering graphs and graph products. In this paper we extend some of the methods for recognizing Cartesian product graphs to graph bundles. Two main notions are used. The first one is the well-known equivalence relation δ defined on the edge-set of a graph. The second one is the concept of k-convex subgraphs. A subgraph H is k-convex in G, if for any two ve...
متن کاملRecognizing activities with cluster-trees of tracklets
Although the structure of simple actions can be captured by rigid grids [3] or by sequences of short temporal parts [2], activities are composed of a variable number of sub-events connected by more complex spatio-temporal relations. In this paper, we learn how to automatically represent activities as a hierarchy of mid-level motion components in order to improve activity classification in real-...
متن کاملRecognizing Union-Find trees is NP-complete
Disjoint-Set forests, consisting of Union-Find trees are data structures having a widespread practical application due to their efficiency. Despite them being well-known, no exact structural characterization of these trees is known (such a characterization exists for Union trees which are constructed without using path compression). In this paper we provide such a characterization and show that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2019
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2019.08.010