亵渎
发表于 2025-3-23 13:39:20
https://doi.org/10.1007/978-94-007-4945-0s had a common adjacent uncoloured vertex. This multigraph was then coloured using at most 5 colours and our "nice" set of vertices was chosen using this colouring. For more details, see . We are indebted to an anonymous referee for pointing out Luby‘s technique and thus speeding up the algorithm considerably.
Acupressure
发表于 2025-3-23 15:25:15
http://reply.papertrans.cn/39/3881/388045/388045_12.png
Interferons
发表于 2025-3-23 21:53:45
Separating a polyhedron by one translation from a set of obstacles,lem which is: determine all directions in which a convex polyhedron can be separated from a set of convex obstacles. Our results are obtained by avoiding the standard technique of motion planning problems, the Ω(..) time computation of the Minkowski differences of the polyhedra.
antidepressant
发表于 2025-3-24 02:01:48
http://reply.papertrans.cn/39/3881/388045/388045_14.png
亵渎
发表于 2025-3-24 02:53:11
http://reply.papertrans.cn/39/3881/388045/388045_15.png
yohimbine
发表于 2025-3-24 08:19:30
http://reply.papertrans.cn/39/3881/388045/388045_16.png
抒情短诗
发表于 2025-3-24 10:59:31
https://doi.org/10.1007/978-3-642-77894-0 by forbidden configurations. It follows that the monadic second order theory of a context-free set of graphs is decidable, and that every graph property expressible in monadic second-order logic is decidable in polynomial time for graphs of a given maximal tree-width.
ALERT
发表于 2025-3-24 16:08:53
Molecular Origins of Brain and Body Geometryll the graphs in which every spanning tree is a . tree. These graphs are called .. The characterization we present shows that a large variety of graphs are not ., and therefore the following question is naturally raised: . We give an algorithm to answer this question in linear (.(|.|)) time.
Preserve
发表于 2025-3-24 21:21:35
A. Cittadini,R. Baserga,D. Cordan, that uses .(log .) time and .(..) processors on a CRCW PRAM. Also, we give a parallel algorithm that transforms a given tree-decomposition of a graph . with treewidth . to another tree-decomposition of . with treewidth ≤ 3.+2, such that the tree in this tree-decomposition is binary and has logari
disrupt
发表于 2025-3-24 23:41:44
https://doi.org/10.1007/978-3-319-53082-6t the property holds just in case the property (or a related property) holds for some specific subgraphs determined by the fibres of the derivation. On the one hand, this leads to proper tests of compatible properties. On the other hand, compatible properties turn out to be decidable for the corresp