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

Contraction of an edge e merges its end points into a new single vertex, and each neighbor of one of the end points of e is a…

2008

The tree-width of a graph G is the minimum integer k subgraph of a k-tree.This paper studies the tree-width of the product of a…

2007

In this paper we present a parallel algorithm which, given a graph G of bounded treewidth (i.e. G is a partial k-tree for some…

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…

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

For a given graph G and p pairs (si, ti), 1≤i≤p, of vertices in G, the edge-disjoint paths problem is to find p pairwise edge…

1994

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

1994

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

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…