• Thumbnail for Branch-decomposition
    to define a notion of branch-decomposition for matroids that generalizes branch-decompositions of graphs. A branch-decomposition of a matroid is a hierarchical...
    21 KB (2,449 words) - 02:47, 16 March 2025
  • Thumbnail for Unrooted binary tree
    graph. That is, a branch-decomposition may be viewed as a hierarchical clustering of the edges of the graph. Branch-decompositions and an associated numerical...
    14 KB (1,971 words) - 05:59, 2 June 2025
  • Thumbnail for Tree decomposition
    constraint satisfaction, query optimization, and matrix decomposition. The concept of tree decomposition was originally introduced by Rudolf Halin (1976). Later...
    12 KB (1,537 words) - 04:11, 25 September 2024
  • them. Decomposition relies on chemical processes similar to digestion in animals; in fact, many sources use the words digestion and decomposition interchangeably...
    12 KB (1,385 words) - 04:23, 25 May 2025
  • property that is held by all cards). decomposition See tree decomposition, path decomposition, or branch-decomposition. degenerate degeneracy A k-degenerate...
    109 KB (16,011 words) - 18:32, 30 April 2025
  • decomposition. Decomposition can be a gradual process for organisms that have extended periods of dormancy. One can differentiate abiotic decomposition from biotic...
    57 KB (6,414 words) - 05:26, 2 June 2025
  • overall structure forms a branch-decomposition instead of a tree decomposition. The width of any separation in this decomposition is, again, bounded by the...
    73 KB (10,072 words) - 06:45, 12 May 2025
  • forbidden minors. Branch-decompositions of matroids may be defined analogously to their definition for graphs. A branch-decomposition of a matroid is a...
    16 KB (1,995 words) - 04:03, 25 September 2024
  • Branch-decomposition, a hierarchical clustering of the edges of a graph, and branchwidth, a graph parameter defined from these decompositions Branch (mathematical...
    4 KB (545 words) - 21:33, 30 December 2023
  • Thumbnail for Hamiltonian decomposition
    In graph theory, a branch of mathematics, a Hamiltonian decomposition of a given graph is a partition of the edges of the graph into Hamiltonian cycles...
    15 KB (1,760 words) - 21:27, 30 May 2025
  • In ring theory, a branch of mathematics, a Peirce decomposition /ˈpɜːrs/ is a decomposition of an algebra as a sum of eigenspaces of commuting idempotent...
    5 KB (615 words) - 00:48, 19 May 2025
  • tree decomposition of an undirected graph, one less than the size of the largest vertex-set in the decomposition. Width of a path decomposition of an...
    2 KB (309 words) - 10:21, 29 March 2024
  • axes. The polar decomposition of a square matrix A {\displaystyle A} always exists. If A {\displaystyle A} is invertible, the decomposition is unique, and...
    26 KB (4,272 words) - 13:01, 26 April 2025
  • Manifold decomposition works in two directions: one can start with the smaller pieces and build up a manifold, or start with a large manifold and decompose it...
    4 KB (192 words) - 11:21, 4 November 2021
  • its vertices; these are called branch-decompositions. A carving of a graph can be converted into a branch decomposition by attaching each graph edge to...
    7 KB (880 words) - 04:54, 12 March 2025
  • Thumbnail for Graph coloring
    time. If the graph is planar and has low branch-width (or is nonplanar but with a known branch-decomposition), then it can be solved in polynomial time...
    70 KB (8,459 words) - 05:58, 16 May 2025
  • infinitesimal. Hackenbush can only represent tepid and cold games (by its decomposition into a purple mountain and a green jungle). For example, consider a...
    6 KB (895 words) - 15:53, 14 May 2025
  • reformulation, such as Dantzig–Wolfe decomposition, to form what is known as the Master Problem. The decomposition is performed to obtain a problem formulation...
    7 KB (803 words) - 19:03, 23 August 2023
  • Thumbnail for NP-completeness
    "Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions". Proc. 13th European Symposium on Algorithms (ESA '05). Lecture...
    30 KB (3,618 words) - 08:25, 21 May 2025
  • Thumbnail for Dominating set
    cubic in n may be obtained by applying dynamic programming to a branch-decomposition of the kernel. More generally, the dominating set problem and many...
    31 KB (4,082 words) - 23:42, 29 April 2025
  • Thumbnail for Ear decomposition
    sequence is taken to be a cycle. An open ear decomposition or a proper ear decomposition is an ear decomposition in which the two endpoints of each ear after...
    15 KB (1,904 words) - 22:28, 18 February 2025
  • decomposition may also be found with the additional property that a chosen matroid element belongs to every circuit. Finding a branch-decomposition of...
    33 KB (4,287 words) - 21:15, 23 February 2025
  • Forensic entomological decomposition is how insects decompose dead tissue and what that means for timing and information in criminal investigations. Medicolegal...
    20 KB (2,512 words) - 21:03, 22 April 2025
  • Kevin Mugo). Int. J. Number Theory 8 (2012), no. 4, 911–922. 2013 Branch decomposition heuristics for linear matroids (with Jing Ma, Susan Margulies and...
    11 KB (1,013 words) - 23:44, 20 February 2025
  • Empirical Mode Decomposition have been used to analyze characterization of multidimensional signals. The empirical mode decomposition (EMD) method can...
    40 KB (7,060 words) - 14:16, 12 February 2025
  • Hankel matrix (0,1)-matrix Matrix decomposition Cholesky decomposition LU decomposition QR decomposition Polar decomposition Reducing subspace Spectral theorem...
    5 KB (377 words) - 12:12, 30 October 2023
  • Thumbnail for Hydrogen peroxide
    The rate of decomposition increases with rise in temperature, concentration, and pH. H2O2 is unstable under alkaline conditions. Decomposition is catalysed...
    93 KB (9,319 words) - 16:12, 1 June 2025
  • basic block is a straight-line code sequence with no branches in except to the entry and no branches out except at the exit. This restricted form makes...
    6 KB (801 words) - 23:11, 1 August 2024
  • Thumbnail for Clique-width
    found for them, in polynomial time using an algorithm based on split decomposition. For graphs of unbounded clique-width, it is NP-hard to compute the...
    19 KB (2,057 words) - 08:12, 9 September 2024
  • Thumbnail for Clique-sum
    as the decomposition of chordal graphs or strangulated graphs, no edges should be removed. In other contexts, such as the SPQR-tree decomposition of graphs...
    10 KB (1,178 words) - 04:08, 25 September 2024