Semantic Scholar uses AI to extract papers important to this topic.
We consider the PC-algorithm (Spirtes et al., 2000) for estimating the skeleton and equivalence class of a very high-dimensional… Expand We propose a graph drawing algorithm that is both efficient and high quality. This algorithm combines a multilevel approach… Expand A four-pass algorithm for drawing directed graphs is presented. The fist pass finds an optimal rank assignment using a network… Expand The strong analogy between biological viruses and their computational counterparts has motivated the authors to adapt the… Expand We introduce the notion of geometric constructions in Rm governed by a directed graph G and by similarity ratios which are… Expand In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms… Expand Recently, Fredman and Tarjan invented a new, especially efficient form of heap (priority queue). Their data structure… Expand An algorithm is presented which finds all the elementary circuits of a directed graph in time bounded by $O((n + e)(c + 1))$ and… Expand We consider economical representations for the path information in a directed graph. A directed graph $G^t $ is said to be a… Expand The value of depth-first search or “backtracking” as a technique for solving problems is illustrated by two examples. An improved… Expand