套索 发表于 2025-3-30 11:46:42

http://reply.papertrans.cn/103/10201/1020029/1020029_51.png

Palate 发表于 2025-3-30 16:17:25

Vertex-Coloring with Star-Defects. Also, we prove that an outerpath (i.e., an outerplanar graph whose weak-dual is a path) always admits such a two-coloring. Finally, we present NP-completeness results for non-planar and planar graphs of bounded degree for the cases of two and three colors.

CHECK 发表于 2025-3-30 17:24:10

http://reply.papertrans.cn/103/10201/1020029/1020029_53.png

有限 发表于 2025-3-31 00:36:25

On Aligned Bar 1-Visibility Graphss a weak . graph, whereas . graphs are incomparable, e.g., with planar, k-planar, outer-fan-planar, (1, .)-visibility, and RAC graphs. For the latter proofs we also use a new operation, called path-addition, which distinguishes classes of beyond planar graphs.

粘连 发表于 2025-3-31 02:14:09

http://reply.papertrans.cn/103/10201/1020029/1020029_55.png

Nerve-Block 发表于 2025-3-31 05:35:45

http://reply.papertrans.cn/103/10201/1020029/1020029_56.png

organic-matrix 发表于 2025-3-31 12:30:49

http://reply.papertrans.cn/103/10201/1020029/1020029_57.png

Malfunction 发表于 2025-3-31 15:46:06

http://reply.papertrans.cn/103/10201/1020029/1020029_58.png

Fibrillation 发表于 2025-3-31 20:58:23

Mixing Times of Markov Chains of 2-Orientationstation where every inner vertex has outdegree 2. We show that there is a class of plane quadrangulations such that the up-down Markov chain on the 2-orientations of these quadrangulations is slowly mixing. On the other hand the chain is rapidly mixing on 2-orientations of quadrangulations with maximum degree at most 4.

FUSE 发表于 2025-3-31 21:48:50

Optimal Distributed Searching in the Plane with and Without Uncertaintyarios such as differential search speeds, late arrival times to the search effort and low probability of detection under poor visibility conditions. We show that, surprisingly, the theoretical idealized model still governs the search with certain suitable minor adaptations.
页: 1 2 3 4 5 [6] 7 8
查看完整版本: Titlebook: WALCOM: Algorithms and Computation; 10th International W Mohammad Kaykobad,Rossella Petreschi Conference proceedings 2016 Springer Internat