gentle
发表于 2025-3-28 16:23:15
http://reply.papertrans.cn/39/3881/388032/388032_41.png
果仁
发表于 2025-3-28 18:58:49
https://doi.org/10.1007/b138111at admit non-negative real weights associated to their vertices so that a set of vertices is a total dominating set if and only if the sum of the corresponding weights exceeds a certain threshold. We show that these graphs, which we call total domishold graphs, form a non-hereditary class of graphs
Impugn
发表于 2025-3-29 02:53:30
https://doi.org/10.1007/978-3-322-88619-4inds one with minimum number of edges. We also show that it is . to decide whether a connected .-vertex graph has a square root with at most . − 1 + . edges when this problem is parameterized by .. Finally, we give an exact exponential time algorithm for the problem of finding a square root with max
中止
发表于 2025-3-29 07:08:22
http://reply.papertrans.cn/39/3881/388032/388032_44.png
转向
发表于 2025-3-29 09:52:45
http://reply.papertrans.cn/39/3881/388032/388032_45.png
吹气
发表于 2025-3-29 12:26:28
Modularisierung von IT-Dienstleistungene that .. To demonstrate the tightness of this bound, we notice that the above inequality implies .(.) ∈ Ω((log. .).), where . is any positive constant smaller than 1, and describe an infinite family of 3-connected planar graphs for which .(.) ∈ .(log.). As a byproduct of our research, we prove a re
恶意
发表于 2025-3-29 17:43:42
Graph-Theoretic Concepts in Computer Science978-3-642-45043-3Series ISSN 0302-9743 Series E-ISSN 1611-3349
Parley
发表于 2025-3-29 20:37:32
https://doi.org/10.1007/978-3-663-14361-1irst constant upper bound on the spanning ratio of this graph. The upper bound uses a constructive argument, giving a, possibly self-intersecting, path between any two vertices, whose length is at most . times the Euclidean distance between the vertices. We also give a lower bound on the spanning ratio of . (11.-17) ≈ 3.798.
Admire
发表于 2025-3-30 03:34:23
https://doi.org/10.1007/978-3-663-08152-4+ .) time algorithm for computing the scattering number of an interval graph with . vertices and . edges, which improves the .(. .) time bound of Kratsch, Kloks and Müller. As a consequence of our two results the maximum . for which an interval graph is .-Hamilton-connected can be computed in .(. + .) time.
绊住
发表于 2025-3-30 04:52:47
http://reply.papertrans.cn/39/3881/388032/388032_50.png