Titlebook: ;

注意

Nucleate

Bretislav Friedrich,Horst Schmidt-B?ckingWe present the first efficient algorithm for a coarse grained multiprocessor that colors a graph . with a guarantee of at most Δ.+1 colors.

Outwit

Water-Brash

Approximating the Treewidth of AT-Free Graphs,Using the specific structure of the minimal separators of AT-free graphs, we give a polynomial time algorithm that computes a triangulation whose width is no more than twice the treewidth of the input graph.

不要不誠實(shí)

,Diameter of the Kn?del Graph,Diameter of the 2.-node Kn?del graph is [(. + 2)/2].

抗體

On the Domination Search Number,We introduce the domination search game which can be seen as a natural modification of the well-known node search game. Various results concerning the domination search number of a graph are presented.

商議

Graph Coloring on a Coarse Grained Multiprocessor (Extended Abstract),We present the first efficient algorithm for a coarse grained multiprocessor that colors a graph . with a guarantee of at most Δ.+1 colors.

皺痕

BRACE

虛度

https://doi.org/10.1007/978-1-4419-1513-9ur new bounds are tight up to a constant factor. As a by-product, we derive new lower bounds for the bisection widths of 3- and 4-regular graphs. We use them to establish tighter lower bounds for the bisection width of 3- and 4-regular Ramanujan graphs.