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

Hierarchical embedding constraints define a set of allowed cyclic orders for the edges incident to the vertices of a graph. These…

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…

2016

The field of complex networks has seen a steady growth in the last decade, fuelled by an ever-growing collection of relational…

2012

It is well known that many local graph problems, like Vertex Cover and Dominating Set, can be solved in 2^{O(tw)}|V|^{O(1)} time…

2011

We provide a new theory, alternative to bidimensionality, of sub-exponential parameterized algorithms on planar graphs, which is…

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

We propose efficient implementations of Seymour and Thomas algorithm which, given a planar graph and an integer β, decides…

2006

2004

In this paper we introduce our computer program Macek for structural computations with matroids representable over nite (partial…