Partial k-tree - Open Access .click

Results 231 to 240 of about 818,578 (247)

Some of the next articles are maybe not open access.

A linear algorithm for edge-coloring partial k-trees

1993
Many combinatorial problems can be efficiently solved for partial k-trees. The edge-coloring problem is one of a few combinatorial problems for which no linear-time algorithm has been obtained for partial k-trees. The best known algorithm solves the problem for partial k-trees G in time \(O\left( {n\Delta ^{2^{2\left( {k + 1} \right)} } } \right ...
Shin-ichi Nakano, Takao Nishizeki, Xiao Zhou +2 more
openaire +1 more source

Algorithms for finding f-colorings of partial k-trees

1995
In an ordinary edge-coloring of a graph G=(V, E) each color appears at each vertex v ∈ V at most once. An f-coloring is a generalized edge-coloring in which each color appears at each vertex v ∈ V at most f(v) times, where f(v) is a positive integer assigned to v.
Takao Nishizeki, Xiao Zhou
openaire +2 more sources

The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees

1998
Many combinatorial problems are NP-complete for general graphs, but are not NP-complete for partial k-trees (graphs of treewidth bounded by a constant k) and can be efficiently solved in polynomial time or mostly in linear time for partial k-trees.
Takao Nishizeki, Xiao Zhou
openaire +2 more sources

A Linear Algorithm for Finding \boldmath[{ g,f }]-Colorings of Partial \boldmath{ k }-Trees