Find link

language:

Find link is a tool written by Edward Betts.

searching for Tree decomposition 18 found (41 total)

Tangle (mathematics) (987 words) [view diff] no match in snippet view article

different use of 'tangle' appears in Graph minors X. Obstructions to tree-decomposition by N. Robertson and P. D. Seymour, Journal of Combinatorial Theory

Clique-sum (1,178 words) [view diff] exact match in snippet view article find links to article

no edges should be removed. In other contexts, such as the SPQR-tree decomposition of graphs into their 3-vertex-connected components, all edges should

Hybrid algorithm (constraint satisfaction) (1,041 words) [view diff] exact match in snippet view article

algorithm works on the tree decomposition. In general, a constraint satisfaction problem can be solved by first creating a tree decomposition and then using a

Star (graph theory) (702 words) [view diff] no match in snippet view article

Neil; Seymour, Paul D. (1991), "Graph minors. X. Obstructions to tree-decomposition", Journal of Combinatorial Theory, 52 (2): 153–190, doi:10.1016/0095-8956(91)90061-N

RAPTOR (software) (1,124 words) [view diff] exact match in snippet view article

used to fill the loops and avoid clashes. For side chain packing, a tree decomposition algorithm is used to pack up all the side chains and avoid any clashes

Geometric constraint solving (1,290 words) [view diff] exact match in snippet view article find links to article

set: decomposition-recombination planning algorithms, tree decomposition, C-tree decomposition, graph reduction, re-parametrization and reduction, computing

Haven (graph theory) (2,133 words) [view diff] exact match in snippet view article

haven of order k if and only if it has treewidth at least k – 1. A tree decomposition may be used to describe a winning strategy for the pursuers in the

Constraint satisfaction dual problem (1,067 words) [view diff] no match in snippet view article find links to article

tree. Decomposition methods generalize join-tree clustering by grouping variables in such a way the resulting problem has a join tree. Decomposition methods

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

the treewidth of a circle graph can be determined, and an optimal tree decomposition constructed, in O(n3) time. Additionally, a minimum fill-in (that

Quadrature mirror filter (900 words) [view diff] exact match in snippet view article find links to article

Galand. Perfect channel splitting by use of interpolation/decimation tree decomposition techniques. First International Conference on Sciences and Systems

William Ward Armstrong (1,124 words) [view diff] case mismatch in snippet view article find links to article

Bochmann, W. W. Armstrong, Properties of Boolean Functions with a Tree Decomposition, BIT, V. 1, No. 13, 1-13, 1974. William W. Armstrong, Trainable Digital

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

contourlet packets are similar to the wavelet packets which allows quad-tree decomposition of both low-pass and high-pass channels and then apply the DFB on

Unrooted binary tree (1,967 words) [view diff] no match in snippet view article find links to article

Neil; Seymour, Paul D. (1991), "Graph minors. X. Obstructions to tree-decomposition", Journal of Combinatorial Theory, 52 (2): 153–190, doi:10.1016/0095-8956(91)90061-N

Gregor von Bochmann (computer scientist) (790 words) [view diff] exact match in snippet view article

Armstrong, W. W. (March 1974). "Properties of boolean functions with a tree decomposition". BIT. 14 (1): 1–13. doi:10.1007/BF01933112. S2CID 115132511. Bochmann

1-planar graph (2,757 words) [view diff] exact match in snippet view article find links to article

results only for graphs with a known 1-planar embedding, and use a tree decomposition of a planarization of the embedding with crossings replaced by degree-four

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

information flow, in particular classifications (Barwise & Seligman 1997). Tree decomposition Information algebras are organized into a hierarchical tree structure

Feedback arc set (6,130 words) [view diff] exact match in snippet view article find links to article

graphs of treewidth t {\displaystyle t} , dynamic programming on a tree decomposition of the graph can find the minimum feedback arc set in time polynomial

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

theory of countable graphs with treewidth ≤k (and a corresponding tree decomposition) is interpretable in S2S (see Courcelle's theorem). For example, the