Partial k-tree

In graph theory, a partial k-tree is a type of graph, defined either as a subgraph of a k-tree or as a graph with treewidth at most k. Many NP-hard…

Papers overview

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

2014

Let G be a graph with a single source w, assigned a positive integer called the supply. Every vertex other than w is a sink…

2009

2005

The treewidth of graph G is the minimum integer k to make a subgraph of a k-tree by G. It can be also defined in terms of…

2002

Let each vertex v of a graph G have a positive integer weight ?(v). Then a multicoloring of G is to assign each vertex v a set of…

1998

This paper addresses memory requirement issues arising in implementations of algorithms on graphs of bounded treewidth. Such…

1997

A c-vertex-ranking of a graph G for a positive integer c is a labeling of the vertices of G with integers such that, for any…

1996

We show that a graph decision problem can be defined in the Counting Monadic Second-order logic if the partial 3-trees that are…

1994

Many combinatorial problems can be efficiently solved for partial k-trees (graphs of treewidth bounded by k). The edge-coloring…

1993

The problem of allocating modules to processors in a distributed system to minimize total costs when the underlying communication…

1991

The existence of a k-separator in a partial k-tree graph is proved and a linear time algorithm is constructed that finds such a…