陈腐的人 发表于 2025-3-25 05:59:56
A Global ,-Level Crossing Reduction Algorithmossing minimizations, which are still .-hard..We introduce a global crossing reduction, which at any particular time captures all crossings, especially for long edges. Our approach is based on the sifting technique and improves the level-by-level heuristics in the hierarchic framework by a further rminimal 发表于 2025-3-25 10:24:32
Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygonalled “computing instead of storing”, we can design a naive quadratic-time algorithm for the problem using only constant work space, i.e., .(log.) bits in total for the work space, where . is the number of nodes in the tree. Then, another technique “controlled recursion” improves the time bound to .municipality 发表于 2025-3-25 12:40:49
http://reply.papertrans.cn/103/10201/1020037/1020037_23.png图画文字 发表于 2025-3-25 15:59:49
http://reply.papertrans.cn/103/10201/1020037/1020037_24.pngWAG 发表于 2025-3-25 22:41:39
http://reply.papertrans.cn/103/10201/1020037/1020037_25.png慌张 发表于 2025-3-26 03:51:17
Small Grid Drawings of Planar Graphs with Balanced Bipartitionrsection. It has been known that every planar graph . of . vertices has a grid drawing on an (. − 2)×(. − 2) integer grid and such a drawing can be found in linear time. In this paper we show that if a planar graph . has a balanced bipartition then . has a grid drawing with small grid area. More preBALE 发表于 2025-3-26 07:39:26
Acyclically 3-Colorable Planar Graphsmaximum degree 4 and we show that there exist infinite classes of cubic planar graphs that are not acyclically 3-colorable. Further, we show that every planar graph has a subdivision with one vertex per edge that is acyclically 3-colorable. Finally, we characterize the series-parallel graphs such thChronological 发表于 2025-3-26 08:41:37
http://reply.papertrans.cn/103/10201/1020037/1020037_28.png针叶树 发表于 2025-3-26 12:38:32
http://reply.papertrans.cn/103/10201/1020037/1020037_29.png无意 发表于 2025-3-26 18:55:04
http://reply.papertrans.cn/103/10201/1020037/1020037_30.png