Branch-decomposition

Known as: Branch-width, Branchwidth, Width (disambiguation)

In graph theory, a branch-decomposition of an undirected graph G is a hierarchical clustering of the edges of G, represented by an unrooted binary…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2019

The decomposition of graphs is a prominent algorithmic task with numerous applications in computer science. A graph decomposition…

2018

We study tensor networks as a model of arithmetic computation for evaluating multilinear maps. This model turns out to be strong…

2018

Lattice path matroids form a subclass of transversal matroids and were introduced by Bonin, de Mier and Noy. Transversal matroids…

2018

. We study tensor networks as a model of arithmetic computation for evaluating multilinear maps. This model turns out to be…

2015

One of the central problems in matroid theory is Rota's conjecture that, for all prime powers q, the class of GF(q)-representable…

2013

The notions of branchwidth and branch-decomposition of graphs are introduced by Robertson and Seymour and have important…

2009

A notion of branch-width may be defined for matroids, which generalizes the one known for graphs. We first give a proof of the…

2008

2007

This paper revisits the ’branchwidth territories’ of Kloks, Kratochv́ıl and Müller [12] to provide a simpler proof and a faster…

2006