Results 251 to 260 of about 102,821 (271)

Optimal broadcasting in almost trees and partial k-trees

1998
We consider message broadcasting in networks that have almost tree topology. The source node of the input network has a single message which has to be broadcasted to all nodes of the network. In every time unit each node that has already received the message can send it to one of its neighbors.
Anders Dessmark, Andrzej Lingas, Hans Olsson, Hiroaki Yamamoto   +3 more
openaire   +1 more source

A parallel algorithm for edge-coloring partial k-trees

1994
Many combinatorial problems can be efficiently solved for partial k-trees (graphs of treewidth bounded by k). The edge-coloring problem is one of the well-known combinatorial problems for which no NC algorithms have been obtained for partial k-trees.
Xiao Zhou, Shin-ichi Nakano, Takao Nishizeki   +2 more
openaire   +1 more source

Definability Equals Recognizability of Partial 3-Trees and \sl k -Connected Partial \sl k -Trees

Algorithmica, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

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.
Xiao Zhou, Takao Nishizeki
openaire   +1 more source

Generalized vertex-rankings of partial k-trees

, 1997
Md. Abul Kashem, Xiao Zhou, Takao Nishizeki   +2 more
openalex   +1 more source

Sequential and parallel algorithms for embedding problems on classes of partial k-trees

, 1994
Arvind Gupta, Naomi Nishimura
openalex   +1 more source

Characterizations of k-Terminal Flow Networks and Computing Network Flows in Partial k-Trees

, 1995
Torben Hagerup, Jyrki Katajainen, Naomi Nishimura, Prabhakar Ragde   +3 more
openalex   +1 more source

On the Complexity of the Maximum Common Subgraph Problem for Partial k-Trees of Bounded Degree

, 2012
Tatsuya Akutsu, Takeyuki Tamura
openalex   +1 more source

Algorithms for finding f-colorings of partial k-trees

1995
Xiao Zhou, Takao Nishizeki
openaire   +1 more source

Lower bounds for the game colouring number of partial k-trees and planar graphs

, 2007
Jiaojiao Wu, Xuding Zhu
openalex   +1 more source