Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: Force-directed graph drawing (view), Bidirected graph (view)

searching for Directed graph 153 found (498 total)

Scribe (log server) (260 words) [view diff] exact match in snippet view article

and released in 2008 as open source. Scribe servers are arranged in a directed graph, with each server knowing only about the next server in the graph. This

Shortest path problem (4,451 words) [view diff] exact match in snippet view article find links to article

directed graph to a single destination vertex v. This can be reduced to the single-source shortest path problem by reversing the arcs in the directed

Tree (graph theory) (3,383 words) [view diff] exact match in snippet view article

in-tree. A rooted tree itself has been defined by some authors as a directed graph. A rooted forest is a disjoint union of rooted trees. A rooted forest

Diomidis Spinellis (612 words) [view diff] exact match in snippet view article find links to article

fast inter-process communication plumbing utility and directed graph shell the directed graph Unix shell for big data and stream processing pipelines

Graph homomorphism (4,860 words) [view diff] exact match in snippet view article find links to article

apply to directed graphs and a directed graph is also equivalent to a unique core. Every graph and every directed graph contains its core as a retract

Polytree (888 words) [view diff] exact match in snippet view article find links to article

directed edge; i.e. there must be no pair of vertices linked in the directed graph by edges in both directions.) A polyforest (or directed forest or oriented

Discrete system (193 words) [view diff] exact match in snippet view article find links to article

called analog systems. A final discrete system is often modeled with a directed graph and is analyzed for correctness and complexity according to computational

Network controllability (1,518 words) [view diff] exact match in snippet view article find links to article

edges without common vertices. Liu et al. extended this definition to directed graph, where a matching is a set of directed edges that do not share start

Cyclic graph (215 words) [view diff] exact match in snippet view article find links to article

a directed graph with no cycles Strongly connected graph, a directed graph in which every edge belongs to a cycle Aperiodic graph, a directed graph in

Bioinformatics workflow management system (1,097 words) [view diff] exact match in snippet view article find links to article

abstract representation of how a computation proceeds in the form of a directed graph, where each node represents a task to be executed and edges represent

Ice rules (418 words) [view diff] no match in snippet view article find links to article

lattice. The distribution of bonds on this lattice is represented by a directed-graph (arrows) and can be either ordered or disordered. In 1935, Linus Pauling

Event relationship graph (97 words) [view diff] exact match in snippet view article find links to article

Event relationship graphs (ERGs) are a type of directed graph (with labeled and annotated vertices and annotated edges) used for modeling discrete-event

Stochastic roadmap simulation (276 words) [view diff] exact match in snippet view article find links to article

connecting points randomly sampled from that space. A roadmap G = (V,E) is a directed graph. Each vertex v is a randomly sampled conformation in C. Each (directed)

PPAD (complexity) (1,003 words) [view diff] exact match in snippet view article

exists a y such that P(x,y) holds is based on a parity argument on a directed graph. The class is formally defined by specifying one of its complete problems

Tarjan's algorithm (104 words) [view diff] exact match in snippet view article find links to article

undirected graph Tarjan's algorithm for finding simple circuits in a directed graph List of algorithms Tarjan, Robert E. (1974), "A Note on Finding the

Littelmann path model (2,147 words) [view diff] exact match in snippet view article find links to article

tensor products and branching rules can be calculated using a coloured directed graph, with labels given by the simple roots of the Lie algebra. Developed

Depth-first search (2,449 words) [view diff] exact match in snippet view article find links to article

in-ordering and reverse in-ordering. For example, when searching the directed graph below beginning at node A, the sequence of traversals is either A B

Minimum bottleneck spanning tree (1,346 words) [view diff] exact match in snippet view article find links to article

contain a spanning tree with a smaller bottleneck edge weight. For a directed graph, a similar problem is known as Minimum Bottleneck Spanning Arborescence

Quotient graph (598 words) [view diff] exact match in snippet view article find links to article

are connected, this is called edge contraction. The condensation of a directed graph is the quotient graph where the strongly connected components form the

CoMotion (324 words) [view diff] exact match in snippet view article find links to article

that can contain basic types, arrays, and links to other u-forms. This directed graph of u-forms forms the basis for all data in the system, including visualized

St-planar graph (599 words) [view diff] exact match in snippet view article find links to article

the orientation are on the outer face of the graph. That is, it is a directed graph drawn without crossings in the plane, in such a way that there are no

Intelligent verification (595 words) [view diff] no match in snippet view article find links to article

for different verification methodologies like constrained random, directed, graph-based, use-case based in the same tool. "Intelligent Verification"

AMBIT (323 words) [view diff] no match in snippet view article find links to article

visual programming as data and patterns were used to be represented by directed-graph diagrams. AMBIT/L was implemented for a PDP-10 computer and used to

Bruhat order (644 words) [view diff] exact match in snippet view article find links to article

see the article Weak order of permutations. The Bruhat graph is a directed graph related to the (strong) Bruhat order. The vertex set is the set of elements

Graph dynamical system (1,387 words) [view diff] exact match in snippet view article find links to article

associated to a dynamical system with map F: Kn → Kn is the finite directed graph with vertex set Kn and directed edges (x, F(x)). The structure of the

Transitive closure (2,306 words) [view diff] exact match in snippet view article find links to article

Wisconsin-Madison. ""Purdom's algorithm" on AlgoWiki". ""Transitive closure of a directed graph" on AlgoWiki". (Afrati et al. 2011) Foto N. Afrati, Vinayak Borkar,

Lindström–Gessel–Viennot lemma (3,745 words) [view diff] exact match in snippet view article find links to article

tuples of non-intersecting lattice paths, or, more generally, paths on a directed graph. It was proved by Gessel–Viennot in 1985, based on previous work of

DOT (graph description language) (980 words) [view diff] exact match in snippet view article

A directed graph

Chinese postman problem (1,297 words) [view diff] exact match in snippet view article find links to article

inspection problem. On a directed graph, the same general ideas apply, but different techniques must be used. If the directed graph is Eulerian, one need

Sequential dynamical system (629 words) [view diff] exact match in snippet view article find links to article

to a sequential dynamical system with map F: Kn → Kn is the finite directed graph with vertex set Kn and directed edges (x, F(x)). The structure of the

IBM Configuration Management Version Control (691 words) [view diff] exact match in snippet view article find links to article

Files are created and associated with Components. Components form a directed graph where each Component can have several parents. Components are a logical

Ultragraph C*-algebra (1,082 words) [view diff] exact match in snippet view article find links to article

P(G^{0})\setminus \{\emptyset \}} of nonempty subsets of the vertex set. A directed graph is the special case of an ultragraph in which the range of each edge

Roam (software) (111 words) [view diff] exact match in snippet view article

application developed by Roam Research Inc. The system is built on a directed graph, which frees it from the constraints of the classic filesystem tree

Degree (graph theory) (1,276 words) [view diff] exact match in snippet view article

vertices of odd degree, the Eulerian path is an Eulerian circuit. A directed graph is a directed pseudoforest if and only if every vertex has outdegree

Cederbaum's maximum flow theorem (1,269 words) [view diff] exact match in snippet view article find links to article

minimum-cut theorem. Cederbaum's theorem applies to a particular type of directed graph: G = (V, E). V is the set of nodes. E {\displaystyle E} is the a set

Agreement forest (871 words) [view diff] exact match in snippet view article find links to article

characterization of acyclicity in agreement forest is to consider the directed graph GF that has vertex set F and a directed edge (Xi, Xj) if and only if

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

Roger (December 2016). "Lower and upper competitive bounds for online directed graph exploration". Theoretical Computer Science. 655: 15–29. doi:10.1016/j

Kleene algebra (2,204 words) [view diff] exact match in snippet view article find links to article

computing the shortest path's length for every two vertices of a weighted directed graph, by Kleene's algorithm, computing a regular expression for every two

Schematic capture (612 words) [view diff] exact match in snippet view article find links to article

Hugo (December 2001). "A framework for human-computer interaction in directed graph drawing". Association for Computing Machinery. 9: 63–69. Retrieved December

Pipeline (software) (1,401 words) [view diff] exact match in snippet view article

Kahn process networks to extend the pipeline concept to a more generic directed graph structure Pipeline (Unix) for details specific to Unix Plumber – "intelligent

Maximum flow problem (5,227 words) [view diff] exact match in snippet view article find links to article

problem can be treated as the original maximum flow problem. Given a directed graph G = ( V , E ) {\displaystyle G=(V,E)} and two vertices s {\displaystyle

List of algorithms (7,835 words) [view diff] exact match in snippet view article find links to article

problem in a weighted, directed graph Johnson's algorithm: all pairs shortest path algorithm in sparse weighted directed graph Transitive closure problem:

Mason's gain formula (1,689 words) [view diff] exact match in snippet view article find links to article

because the enumeration of paths in a directed graph grows dramatically. To see this consider the complete directed graph on n {\displaystyle n} vertices,

Power set (2,473 words) [view diff] exact match in snippet view article find links to article

homomorphisms from G to the multigraph Ω definable as the complete directed graph on two vertices (hence four edges, namely two self-loops and two more

Social learning network (866 words) [view diff] exact match in snippet view article find links to article

such as the number of concepts each learner has mastered in common. Directed graph of learners, where directed (and possibly weighted) links can be used

Examples of Markov chains (2,405 words) [view diff] exact match in snippet view article find links to article

diagram for a simple example is shown in the figure on the right, using a directed graph to picture the state transitions. The states represent whether a hypothetical

Functor category (1,776 words) [view diff] exact match in snippet view article find links to article

one object to the other (but not another arrow back the other way). A directed graph consists of a set of arrows and a set of vertices, and two functions

Average path length (553 words) [view diff] exact match in snippet view article find links to article

many nodes, which are neighbors of each other. Consider an unweighted directed graph G {\displaystyle G} with the set of vertices V {\displaystyle V} . Let

Strong orientation (1,858 words) [view diff] exact match in snippet view article find links to article

pairwise edge-disjoint directed paths from u to v in the resulting directed graph is at least ⌊ k 2 ⌋ {\displaystyle \left\lfloor {\frac {k}{2}}\right\rfloor

Free group (2,309 words) [view diff] exact match in snippet view article find links to article

In this approach there is considerable use of free groupoids on a directed graph. Grushko's theorem has the consequence that if a subset B of a free

Game tree (1,288 words) [view diff] exact match in snippet view article find links to article

that player takes to win the game. In game theory, a game tree is a directed graph whose nodes are positions in a game (e.g., the arrangement of the pieces

NL-complete (659 words) [view diff] exact match in snippet view article find links to article

(Papadimitriou 1994 Thrm. 16.2), the problem of determining whether, given a directed graph G and two nodes s and t on that graph, there is a path from s to t.

God's algorithm (1,646 words) [view diff] exact match in snippet view article find links to article

These have in common that they can be modeled mathematically as a directed graph, in which the configurations are the vertices, and the moves are the

ISO 10303 (2,904 words) [view diff] exact match in snippet view article find links to article

called MIM. Modules are built on each other, resulting in an (almost) directed graph with the AP and conformance class modules at the very top. The modular

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

performance problems. A build system that processes dependencies as a directed graph (such as Buck, Bazel, Please, or Pants) solves this by compartmentalizing

Method of Four Russians (590 words) [view diff] exact match in snippet view article find links to article

(1970), "On economical construction of the transitive closure of a directed graph", Dokl. Akad. Nauk SSSR, 194 (11). Original title: "Об экономном построении

GXL (805 words) [view diff] exact match in snippet view article find links to article

for software data. The conceptual data model is a typed, attributed, directed graph. This is not to say that all software data ought to be manipulated as

Operator-precedence grammar (1,283 words) [view diff] exact match in snippet view article find links to article

even if their terminals are not connected by this relation); Create a directed graph whose nodes are the groups. For each pair ⁠ ( a , b ) {\displaystyle

Spin network (1,565 words) [view diff] no match in snippet view article find links to article

must be a whole number. Formally, a spin network may be defined as a (directed) graph whose edges are associated with irreducible representations of a compact

Relational Model/Tasmania (2,061 words) [view diff] exact match in snippet view article find links to article

example, any descriptive characteristic entities. Directed Graph Relations Several directed graph relations are defined to capture further semantic features

Sergio Barbarossa (996 words) [view diff] exact match in snippet view article find links to article

new definition of the Fourier Transform for signals defined over a directed graph. He derived an analytic model for the eigenfunctions of linear time-varying

Kinetic logic (3,101 words) [view diff] exact match in snippet view article find links to article

system. Following is René Thomas’s formalism for Kinetic Logic : In a directed graph G = (V, A), we note G− (v) and G+ (v) the set of predecessors and successors

Spreading activation (1,132 words) [view diff] exact match in snippet view article find links to article

two concepts are by meaning, as well as how a subject is primed. A directed graph is populated by Nodes[ 1...N ] each having an associated activation

Maximally matchable edge (1,268 words) [view diff] exact match in snippet view article find links to article

can construct an alternating cycle that contains e. Now, consider a directed graph H = ( Z , E ) {\displaystyle H=(Z,E)} , where Z = ( z 1 , … , z n )

Friendship graph (849 words) [view diff] exact match in snippet view article find links to article

claim of their non-existence is Kotzig's conjecture. Central digraph, a directed graph with the property that every two vertices can be connected by a unique

Junction tree algorithm (1,139 words) [view diff] exact match in snippet view article find links to article

step concerns only Bayesian networks, and is a procedure to turn a directed graph into an undirected one. We do this because it allows for the universal

Open Mind Common Sense (1,206 words) [view diff] exact match in snippet view article find links to article

the information in the OMCS database. ConceptNet is expressed as a directed graph whose nodes are concepts, and whose edges are assertions of common sense

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

problem of determining whether there is a path between two vertices in a directed graph, which runs in O ( ( log ⁡ n ) 2 ) {\displaystyle O\left((\log n)^{2}\right)}

Symbolic link (3,864 words) [view diff] exact match in snippet view article find links to article

effect of changing an otherwise hierarchic filesystem from a tree into a directed graph, which can have consequences for such simple operations as determining

Hierarchical clustering (2,897 words) [view diff] case mismatch in snippet view article find links to article

Xiaoou (2012). "Graph Degree Linkage: Agglomerative Clustering on a Directed Graph". In Fitzgibbon, Andrew; Lazebnik, Svetlana; Perona, Pietro; Sato, Yoichi;

Make (software) (4,401 words) [view diff] exact match in snippet view article

Meson etc. Free and open-source software portal Dependency graph – Directed graph representing dependencies List of build automation software "V7/usr/src/cmd/make/ident

CPAchecker (389 words) [view diff] exact match in snippet view article find links to article

analyzed by the CPA algorithm, it gets transformed into a CFA. A CFA is a directed graph whose edges represent either assumptions or assignments and its nodes

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

matter) of all the four cubes. First directed graph will represent the front and back faces. Second directed graph will represent the left and right faces

Aanderaa–Karp–Rosenberg conjecture (3,557 words) [view diff] exact match in snippet view article find links to article

directed graph property (the property of containing a "sink") which required only O ( n ) {\displaystyle O(n)} queries to test. A sink, in a directed

Converse relation (1,725 words) [view diff] exact match in snippet view article find links to article

theory) – Term in the mathematical area of order theory Transpose graph – Directed graph with reversed edges Ernst Schröder, (1895), Algebra der Logik (Exakte

Ford–Fulkerson algorithm (2,299 words) [view diff] exact match in snippet view article find links to article

(|E|)}} . import collections class Graph: """ This class represents a directed graph using adjacency matrix representation. """ def __init__(self, graph):

FKT algorithm (1,514 words) [view diff] exact match in snippet view article find links to article

is the sign of the permutation M. A Pfaffian orientation of G is a directed graph H with adjacency matrix B such that pf(B) = PerfMatch(G). In 1967, Kasteleyn

K shortest path routing (1,245 words) [view diff] exact match in snippet view article find links to article

Definitions: G(V, E): weighted directed graph, with set of vertices V and set of directed edges E, w(u, v): cost of directed edge from node u to node v

Copying mechanism (1,161 words) [view diff] exact match in snippet view article find links to article

considered time step. (see fig. 1). Middendorf-Ziv (MZ) proposed a growing directed graph modeling biological network dynamics. A prototype is chosen at random

Undo (2,895 words) [view diff] exact match in snippet view article find links to article

that. The order can be described through a history tree which is a directed graph, "because it is possible to continue redoing commands from another branch

Hierarchy (5,937 words) [view diff] exact match in snippet view article find links to article

to the number of other vertices connected to via outgoing arcs, in a directed graph) a node has. Hierarchies can be categorized based on the "maximum degree"

Wang algebra (648 words) [view diff] exact match in snippet view article find links to article

algebra formulation has been used to systematically generate King-Altman directed graph patterns. Such patterns are useful in deriving rate equations in the

List of NP-complete problems (2,746 words) [view diff] exact match in snippet view article find links to article

parts.: GT11, GT12, GT13, GT14, GT15, GT16, ND14 Grundy number of a directed graph.: GT56 Hamiltonian completion: GT34 Hamiltonian path problem, directed

Associative algebra (4,256 words) [view diff] exact match in snippet view article find links to article

translate to those of A. A quiver algebra (or a path algebra) of a directed graph is the free associative algebra over a field generated by the paths

Resolvent (Galois theory) (1,311 words) [view diff] exact match in snippet view article

subgroup. Transitive subgroups of S n {\displaystyle S_{n}} form a directed graph: one group can be a subgroup of several groups. One resolvent can tell

PPP (complexity) (1,000 words) [view diff] exact match in snippet view article

End-of-the-Line, the input is a start vertex s {\displaystyle s} in a directed graph G {\displaystyle G} where each vertex has at most one successor and

Fair computational tree logic (459 words) [view diff] exact match in snippet view article find links to article

translates to Mf, s |= EGtrue. A strongly connected component (SCC) of a directed graph is a maximal strongly connected subgraph—all the nodes are reachable

Hedetniemi's conjecture (1,853 words) [view diff] exact match in snippet view article find links to article

as observed by Poljak & Rödl (1981). Here, the chromatic number of a directed graph is just the chromatic number of the underlying graph, but the tensor

Graph cuts in computer vision (2,097 words) [view diff] exact match in snippet view article find links to article

maximizing the flow over the network. The max-flow problem consists of a directed graph with edges labeled with capacities, and there are two distinct nodes:

Crystal base (1,993 words) [view diff] exact match in snippet view article find links to article

vectors to basis vectors or 0. A crystal base can be represented by a directed graph with labelled edges. Each vertex of the graph represents an element

Causal graph (1,621 words) [view diff] exact match in snippet view article find links to article

Directed graph that models causal relationships between variables

Greek to me (919 words) [view diff] exact match in snippet view article find links to article

on Wordreference.com[permanent dead link‍] Mark Liberman (January 15, 2009). "The directed graph of stereotypical incomprehensibility". Language Log.

Feature-oriented programming (2,132 words) [view diff] exact match in snippet view article find links to article

files [h1…hk]. A GenVoca value (nested tuples) can be depicted as a directed graph: the graph for parser f is shown in the figure to the right. Arrows

Oriented coloring (558 words) [view diff] exact match in snippet view article find links to article

valid oriented coloring. An oriented coloring can exist only for a directed graph with no loops or directed 2-cycles. For, a loop cannot have different

Markov chain (12,894 words) [view diff] exact match in snippet view article find links to article

{\displaystyle M} is zero or positive, and therefore can be found on a directed graph with s i g n ( M ) {\displaystyle \mathrm {sign} (M)} as its adjacency

Price of stability (1,388 words) [view diff] exact match in snippet view article find links to article

connect s i {\displaystyle s_{i}} to t i {\displaystyle t_{i}} on a directed graph G = ( V , E ) {\displaystyle G=(V,E)} ; The strategies P i {\displaystyle

Acyclic orientation (1,081 words) [view diff] exact match in snippet view article find links to article

assignments of a direction to each cycle edge that make the resulting directed graph acyclic. Two orientations are shown as adjacent when they differ in

Distance-hereditary graph (2,290 words) [view diff] exact match in snippet view article find links to article

distance-hereditary graph is a cograph. The transitive closure of the directed graph formed by choosing any set of orientations for the edges of any tree

Linear temporal logic to Büchi automaton (2,608 words) [view diff] exact match in snippet view article find links to article

and has two steps. In the first step, it incrementally constructs a directed graph. In the second step, it builds a labeled generalized Büchi automaton

Price's model (1,582 words) [view diff] exact match in snippet view article find links to article

to describe many real-world networks such as the Web. Considering a directed graph with n nodes. Let p k {\displaystyle p_{k}} denote the fraction of nodes

Numbers season 3 (817 words) [view diff] exact match in snippet view article find links to article

target. Mathematics used: Set Theory, Center of mass, harmonic series, directed graph, Load flow analysis and Dantzig-Wolfe Decomposition 45 8 "Hardball"

Cloud load balancing (804 words) [view diff] exact match in snippet view article find links to article

Random Sampling bases its job allocation on the network represented by a directed graph. For each execution node in this graph, in-degree means available resources

Weak ordering (4,360 words) [view diff] exact match in snippet view article find links to article

transitive binary relation Weak component – Partition of vertices of a directed graph − the equivalent subsets in the finest weak ordering consistent with

SimRank (2,573 words) [view diff] exact match in snippet view article find links to article

an overall similarity measure. For a node v {\displaystyle v} in a directed graph, we denote by I ( v ) {\displaystyle I(v)} and O ( v ) {\displaystyle

Top trading cycle (1,738 words) [view diff] exact match in snippet view article find links to article

agent to indicate all his top houses. Construct the TTC-graph G: a directed graph in which each agent points to all agents who hold his top houses. Repeat:

Alan J. Hoffman (3,693 words) [view diff] exact match in snippet view article find links to article

total unimodularity, and introduces the concept of a circulation in a directed graph as n generalization of the concept of an s-t flow, in which two of the

List of PSPACE-complete problems (1,807 words) [view diff] exact match in snippet view article find links to article

Pebble game Acyclic pebble game One-player pebble game Token on acyclic directed graph games: Quantified boolean formulas First-order logic of equality Provability

Continuous-time Markov chain (4,241 words) [view diff] exact match in snippet view article find links to article

Directed graph representation of a continuous-time Markov chain describing the state of financial markets (note: numbers are made-up).

Batch summability (1,258 words) [view diff] exact match in snippet view article find links to article

approval voting. The weighted majority graph of a voter profile is a directed graph in which the nodes are the candidates, and there is a directed edge

Persistent data structure (6,116 words) [view diff] exact match in snippet view article find links to article

with any given data structure. In order to achieve that, we consider a directed graph G. We assume that each vertex v in G has a constant number c of outgoing

Congestion game (7,315 words) [view diff] exact match in snippet view article find links to article

The directed graph for a simple congestion game.

Service-oriented programming (3,088 words) [view diff] exact match in snippet view article find links to article

implicit directed graph of inner service dependencies. The runtime environment for SOP can create an execution graph based on this directed graph by automatically

Data stream management system (1,565 words) [view diff] exact match in snippet view article find links to article

declarative query is translated into a logical query plan. A query plan is a directed graph where the nodes are operators and the edges describe the processing

Inductive miner (1,217 words) [view diff] exact match in snippet view article find links to article

to detect various process relations. A directly follows graph is a directed graph that connects an activity A to another activity B if and only if activity

Ramsey's theorem (8,404 words) [view diff] no match in snippet view article find links to article

acyclic (also called "transitive") n-node subtournament. This is the directed-graph analogue of what (above) has been called R(n, n; 2), the smallest number

Brandes' algorithm (1,696 words) [view diff] exact match in snippet view article find links to article

following pseudocode illustrates Brandes' algorithm on an unweighted directed graph. algorithm Brandes(Graph) is for each u in Graph.Vertices do CB[u] ←

Separation oracle (1,626 words) [view diff] exact match in snippet view article find links to article

examples are: The minimum-cost arborescence problem: given a weighted directed graph and a vertex r in it, find a subgraph of minimum cost that contains

Carina Curto (1,112 words) [view diff] exact match in snippet view article find links to article

created by Carina Curto & Katherine Morrison January 2016 Input: a simple directed graph G satisfying two rules: 1. G is an oriented. - ppt download". slideplayer

BioFabric (709 words) [view diff] exact match in snippet view article find links to article

arbitrarily generated within constraints for aesthetics, such as during force-directed graph drawing, and may result in apparently informative artifacts. Edges are

Meta-process modeling (3,320 words) [view diff] exact match in snippet view article find links to article

ordering of intentions and strategies has been included. It is a labelled directed graph with intentions as nodes and strategies as edges between intentions

Dependency network (graphical model) (1,496 words) [view diff] exact match in snippet view article

G , P ) {\displaystyle (G,P)} where G {\displaystyle G} is a cyclic directed graph, where each of its nodes corresponds to a variable in X {\displaystyle

Mixed Chinese postman problem (2,123 words) [view diff] exact match in snippet view article find links to article

{\displaystyle s_{i}=d_{i}^{-}-d_{i}^{+}} for each vertex i in the directed graph ( V , A ∪ A 1 ) {\displaystyle (V,A\cup A_{1})} . A vertex i {\textstyle

Data lineage (5,937 words) [view diff] exact match in snippet view article find links to article

reconstruction is the topological sorting of the association graph. The directed graph created in the previous step is topologically sorted to obtain the order

Gaussian process approximations (2,033 words) [view diff] exact match in snippet view article find links to article

{\displaystyle x_{k}\in X} can then be represented by a vertex in a directed graph and edges correspond to the terms in the factorization of the joint

List of Indian inventions and discoveries (22,512 words) [view diff] exact match in snippet view article find links to article

linear time algorithm to find the strongly connected components of a directed graph. Aho, Hopcroft and Ullman credit it to S. Rao Kosaraju and Micha Sharir

Wai-Kai Chen (1,510 words) [view diff] case mismatch in snippet view article find links to article

Applied Mathematics. 14 (3): 550–560. doi:10.1137/0114048. —— (1967). "On Directed Graph Solutions of Linear Algebraic Equations". SIAM Review. 9 (4): 692–707

Maximal independent set (5,451 words) [view diff] exact match in snippet view article find links to article

=C\log {(n)}/d} (for any constant C), then WHP the longest path in the directed graph determined by the fixed ordering has length O ( log ⁡ ( n ) ) {\displaystyle

Regular path query (658 words) [view diff] exact match in snippet view article find links to article

query language as "property paths". A graph database consists of a directed graph whose edges carry a label. A regular path query is just a regular expression

Klein polyhedron (2,582 words) [view diff] exact match in snippet view article find links to article

-dimensional face. Both of these graphs are structurally related to the directed graph Υ n {\displaystyle \textstyle \Upsilon _{n}} whose set of vertices is

Glossary of category theory (11,455 words) [view diff] exact match in snippet view article find links to article

it has a zero object. polygraph A polygraph is a generalization of a directed graph. polynomial A functor from the category of finite-dimensional vector

Drosophila connectome (3,933 words) [view diff] exact match in snippet view article find links to article

8% were dendro-axonic. To study the connectome, they treated it as a directed graph with the neurons forming nodes and the synapses forming the edges. Using

Nervous system network models (5,049 words) [view diff] exact match in snippet view article find links to article

structural brain connectivity type, the connectivity is a sparse and directed graph. The functional brain connectivity has bidirectional graphs. The effective

Computational law (4,406 words) [view diff] case mismatch in snippet view article find links to article

SSRN. Surden, Harry. "Visualizing U.S. Copyright Law Using a Force Directed Graph". "Public Access to Court Electronic Records". "Law Library of Congress"

Parallel single-source shortest path algorithm (2,662 words) [view diff] exact match in snippet view article find links to article

shortest path algorithm. Let G = ( V , E ) {\displaystyle G=(V,E)} be a directed graph with | V | = n {\displaystyle |V|=n} nodes and | E | = m {\displaystyle

Generalized distributive law (6,400 words) [view diff] exact match in snippet view article find links to article

E_{3},\ldots ,E_{N}\}} , the corresponding message trellis as a finite directed graph with Vertex set of V × { 0 , 1 , 2 , 3 , … , N } {\displaystyle V\times

SNP annotation (3,935 words) [view diff] exact match in snippet view article find links to article

Directed graph of relationships among SNP prediction webservers and their bioinformatics sources.

PLS (complexity) (5,471 words) [view diff] exact match in snippet view article

instance I {\displaystyle I} of a problem L {\displaystyle L} is a directed graph. The nodes represent all elements of the finite set of solutions F L

Myerson value (1,141 words) [view diff] exact match in snippet view article find links to article

ISBN 9781400881970. Li, Daniel Li; Shan, Erfang (2020). "The Myerson value for directed graph games". Operations Research Letters. 48 (2): 142–146. doi:10.1016/j

S2S (mathematics) (4,618 words) [view diff] exact match in snippet view article

regular if it can be obtained by unrolling a vertex-labeled finite directed graph with an initial vertex; a (directed) cycle in the graph reachable from

Parallel all-pairs shortest path algorithm (3,034 words) [view diff] case mismatch in snippet view article find links to article

path algorithm. Let G = ( V , E , w ) {\displaystyle G=(V,E,w)} be a directed Graph with the set of nodes V {\displaystyle V} and the set of edges E ⊆ V

BTRON (4,253 words) [view diff] exact match in snippet view article find links to article

instead of using TAD. BTRON adopts a network-type model with an arbitrary directed graph structure called a real/pseudomorphic model as a file management model

List of RNA structure prediction software (8,455 words) [view diff] exact match in snippet view article find links to article

based viewer for displaying RNA secondary structures using the force-directed graph layout provided by the d3.js visualization library. It is based on fornac

Planar separator theorem (10,072 words) [view diff] exact match in snippet view article find links to article

algorithm is the use of price functions and reduced lengths. For a directed graph G {\displaystyle G} with arc-lengths ℓ ( u v ) {\displaystyle \ell (uv)}

Word-representable graph (3,653 words) [view diff] exact match in snippet view article find links to article

orientations provide a powerful tool to study word-representable graphs. A directed graph is semi-transitively oriented iff it is acyclic and for any directed

Interference freedom (5,613 words) [view diff] exact match in snippet view article find links to article

The data structure used in a conventional implementation of LISP is a directed graph in which each node has at most two outgoing edges, either of which may

Quasi-polynomial time (1,453 words) [view diff] exact match in snippet view article find links to article

Parity games, involving token-passing along the edges of a colored directed graph. The paper giving a quasi-polynomial algorithm for these games won the

Glossary of representation theory (5,011 words) [view diff] exact match in snippet view article find links to article

G-invariant quaternionic structure. quiver A quiver, by definition, is a directed graph. But one typically studies representations of a quiver. rational A representation

Parallel breadth-first search (4,465 words) [view diff] exact match in snippet view article find links to article

An example of CSR representation of a directed graph.

EIDR (5,114 words) [view diff] exact match in snippet view article find links to article

object tree and connecting object trees to each other, producing a directed graph across elements of those trees. isPackagingOf For creating a collection

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

Native data ➡️ text-JData/JSON form binary-JData(BJData/UBJSON) a directed graph object head ={id:0,data:10.1} ⇓ e1 ┌─node1={id:1,data:2.5} │ ⇓ e2 │ node2={id:2

Intuitive statistics (7,109 words) [view diff] exact match in snippet view article find links to article

tackled the problem by advocating the use of Bayesian networks, or directed graph representations of conditional dependencies. In a Bayesian network,

Glossary of set theory (11,628 words) [view diff] exact match in snippet view article find links to article

Aczel's anti-foundation axiom states that every accessible pointed directed graph corresponds to a unique set AD+ An extension of the axiom of determinacy

Source attribution (14,509 words) [view diff] exact match in snippet view article find links to article

GNU General Public License v3.0 seqTrack Genetic distance clustering (directed graph, maximum parsimony) Collection dates, genetic distances GNU General