注意
发表于 2025-3-28 15:19:29
http://reply.papertrans.cn/39/3881/388035/388035_41.png
Nucleate
发表于 2025-3-28 22:21:44
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
发表于 2025-3-29 01:45:39
http://reply.papertrans.cn/39/3881/388035/388035_43.png
Water-Brash
发表于 2025-3-29 06:07:50
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.
不要不诚实
发表于 2025-3-29 08:12:48
,Diameter of the Knödel Graph,Diameter of the 2.-node Knödel graph is [(. + 2)/2].
抗体
发表于 2025-3-29 14:32:18
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.
商议
发表于 2025-3-29 17:00:38
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.
皱痕
发表于 2025-3-29 21:48:54
http://reply.papertrans.cn/39/3881/388035/388035_48.png
BRACE
发表于 2025-3-30 02:38:23
http://reply.papertrans.cn/39/3881/388035/388035_49.png
虚度
发表于 2025-3-30 07:49:18
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.