Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: Iterative deepening depth-first search (view)

searching for Depth-first search 28 found (157 total)

Tarjan's strongly connected components algorithm (1,679 words) [view diff] exact match in snippet view article find links to article

vertex of an acyclic graph. The basic idea of the algorithm is this: a depth-first search (DFS) begins from an arbitrary start node (and subsequent depth-first

CARINE (1,160 words) [view diff] exact match in snippet view article find links to article

depth-first search based algorithm. CARINE's main search algorithm is semi-linear resolution (SLR) which is based on an iteratively-deepening depth-first

Information Processing Letters (520 words) [view diff] exact match in snippet view article find links to article

Alpern, B., Schneider, F.B., Defining liveness, 1985 Reif, J.H., Depth-first search is inherently sequential, 1985 Apt, K.R., Kozen, D.C., Limits for

P-complete (1,539 words) [view diff] no match in snippet view article find links to article

First Depth First Search Ordering – Given a graph with fixed ordered adjacency lists, and nodes u and v, is vertex u visited before vertex v in a depth-first

Robert Tarjan (1,467 words) [view diff] exact match in snippet view article find links to article

collectively cited over 94,000 times. Among the most cited are: 1972: Depth-first search and linear graph algorithms, R Tarjan, SIAM Journal on Computing 1

List of unsolved problems in computer science (694 words) [view diff] exact match in snippet view article find links to article

conjecture: do splay trees have a bounded competitive ratio? Can a depth-first search tree be constructed in NC? Can the fast Fourier transform be computed

John M. Scholes (3,009 words) [view diff] case mismatch in snippet view article find links to article

before Heaney died. The APL side and the romantic side often met: The Depth-First Search video (below) was recorded at dawn on the summer solstice of 2014

Data structure (1,822 words) [view diff] exact match in snippet view article find links to article

acyclic. Graph traversal algorithms include breadth-first search and depth-first search. Stacks and queues are abstract data types that can be implemented

Crowd simulation (7,429 words) [view diff] no match in snippet view article find links to article

depth first search. A random search is where each of the agents go in any direction through the environment and try to find a pathway out. The depth first

Narayana number (1,088 words) [view diff] exact match in snippet view article find links to article

analogous fashion, we can construct a Dyck word from a rooted tree via a depth-first search. Thus, there is an isomorphism between Dyck words and rooted trees

Eugene Myers (584 words) [view diff] case mismatch in snippet view article find links to article

MPI-CBG Janelia Farm Research Campus University of Arizona Thesis A Depth-First search characterization of K-connectivity and its application to connectivity

Graph isomorphism (1,634 words) [view diff] exact match in snippet view article find links to article

algorithm, developed by Cordella et al. in 2001. The vf2 algorithm is a depth-first search algorithm that tries to build an isomorphism between two graphs incrementally

Kuratowski's theorem (1,074 words) [view diff] exact match in snippet view article find links to article

1112/plms/s3-13.1.743, MR 0158387. Williamson, S. G. (September 1984), "Depth-first search and Kuratowski subgraphs", J. ACM, 31 (4): 681–693, doi:10.1145/1634

Hashiwokakero (769 words) [view diff] no match in snippet view article find links to article

"Solving Hashiwokakero puzzle game with Hashi solving techniques and depth first search", Bulletin of Electrical Engineering and Informatics, 1 (1): 61–68

Tree-depth (2,817 words) [view diff] no match in snippet view article find links to article

algorithm can be made linear, by the following method: compute a depth first search tree, and test whether this tree's depth is greater than 2 d {\displaystyle

Planar graph (4,471 words) [view diff] exact match in snippet view article find links to article

based on the existence of a bipartition of the cotree edges of a depth-first search tree. It is central to the left-right planarity testing algorithm;

M-ary tree (2,761 words) [view diff] exact match in snippet view article find links to article

process. One can construct a bit sequence representation using the depth-first search of a m-ary tree with n nodes indicating the presence of a node at

Optimal solutions for the Rubik's Cube (2,981 words) [view diff] exact match in snippet view article find links to article

Pattern Databases". Korf describes this method as follows IDA* is a depth-first search that looks for increasingly longer solutions in a series of iterations

Copeland's method (2,515 words) [view diff] exact match in snippet view article find links to article

compatible with the method's partial order, and is simpler than a depth-first search when the partial order is given by an adjacency matrix. More generally

Splay tree (4,628 words) [view diff] no match in snippet view article find links to article

visiting the elements in T 2 {\displaystyle T_{2}} in preorder (i.e., depth first search order). The total cost of performing the sequence S {\displaystyle

Shlomi Dolev (2,398 words) [view diff] no match in snippet view article find links to article

Labeling Schemes. He also presented the first silent self-stabilizing depth first search distributed algorithm. Another research interest is mobile ad-hoc

Program structure tree (1,164 words) [view diff] exact match in snippet view article find links to article

graph into triconnected components. The algorithm is based on the depth-first search of graphs and requires O ( | V | + | E | ) {\displaystyle O(|V|+|E|)}

Frequent subtree mining (1,837 words) [view diff] exact match in snippet view article find links to article

from the root of the tree, node labels are added to the string in depth-first search order. -1 is added to the string whenever the search process backtracks

TLA+ (5,688 words) [view diff] exact match in snippet view article find links to article

As an alternative to exhaustive breadth-first search, TLC can use depth-first search or generate random behaviours. TLC operates on a subset of TLA+; the

Modular decomposition (3,177 words) [view diff] exact match in snippet view article find links to article

has at most k − 1 {\displaystyle k-1} internal nodes. One can use a depth-first search starting at v {\displaystyle v} to report the labels of leaf-descendants

WARFT (661 words) [view diff] no match in snippet view article find links to article

sorters, multiple operand adders and graph theoretic units like Depth-First-Search, Breadth-First-Search. This introduces a higher level of abstraction

Construction and Analysis of Distributed Processes (2,762 words) [view diff] exact match in snippet view article find links to article

equation systems on the fly Caesar_Stack, which implements stacks for depth-first search exploration Caesar_Table, which handles tables of states, transitions

Routing in delay-tolerant networking (4,129 words) [view diff] exact match in snippet view article find links to article

vectors at hand, the node can then compute a shortest path via a depth-first search where path weights indicate the probability that the link does not