plasma
发表于 2025-3-28 17:48:45
Generalized coloring for tree-like graphs,artial k-trees are solved in linear time, when the number of colors is a constant and by O(¦V¦.)-algorithmsin general. For trees, we improve this to linear time. In contrast to that, . and . differ in complexity for cographs. While the first has a linear algorithm, the second is shown NP-complete. W
amphibian
发表于 2025-3-28 21:57:02
http://reply.papertrans.cn/39/3881/388027/388027_42.png
兵团
发表于 2025-3-29 00:26:04
,Kayles on special classes of graphs — An application of Sprague-Grundy theory,iven graph. The last player that choses a vertex wins the game. We show, with help of Sprague-Grundy theory, that the problem to determine which player has a winning strategy for a given graph, can be solved in O(n. time on interval graphs, on circular arc graphs, on permutation graphs, and on co-co
GNAT
发表于 2025-3-29 03:16:37
http://reply.papertrans.cn/39/3881/388027/388027_44.png
逢迎春日
发表于 2025-3-29 08:02:19
Improved algorithms for routing on two-dimensional grids,e wires. We pay particular attention to routing problems where each wire connects terminals that are distance at most . apart in the grid and where each wire is allowed to have at most . bends. (Typically, . and . are small constants, but they can also represent arbitrary functions of .). Among othe
Adj异类的
发表于 2025-3-29 14:42:24
http://reply.papertrans.cn/39/3881/388027/388027_46.png
侵蚀
发表于 2025-3-29 18:54:35
http://reply.papertrans.cn/39/3881/388027/388027_47.png
暖昧关系
发表于 2025-3-29 22:41:45
http://reply.papertrans.cn/39/3881/388027/388027_48.png
Osmosis
发表于 2025-3-30 03:01:06
On the homogeneous decomposition of graphs,ry graphs: the leaves of this tree are the p-connected components along with weak vertices, that is, vertices of the graph that belong to no p-connected component. By refining this first result, we obtain a new decomposition for arbitrary graphs that generalizes the well-known modular decomposition.
外向者
发表于 2025-3-30 05:04:14
http://reply.papertrans.cn/39/3881/388027/388027_50.png