土坯 发表于 2025-3-26 22:06:29

http://reply.papertrans.cn/23/2299/229879/229879_31.png

共栖 发表于 2025-3-27 02:50:44

Helge Toutenburg,Philipp KnöfelWe prove that every .-node ternary tree has a planar straight-line orthogonal drawing in . area, improving upon the previously best known . bound. Further, we present an upper bound, the outcomes of an experimental evaluation, and a conjecture on the area requirements of planar straight-line orthogonal drawings of complete ternary trees.

Brain-Imaging 发表于 2025-3-27 08:35:58

Linear Clique-Width of Bi-complement Reducible Graphs,We prove that in the class of bi-complement reducible graphs linear clique-width is unbounded and show that this class contains exactly two minimal hereditary subclasses of unbounded linear clique-width.

的’ 发表于 2025-3-27 13:13:37

http://reply.papertrans.cn/23/2299/229879/229879_34.png

Circumscribe 发表于 2025-3-27 16:24:59

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/229879.jpg

使习惯于 发表于 2025-3-27 18:00:02

http://reply.papertrans.cn/23/2299/229879/229879_36.png

overrule 发表于 2025-3-28 01:25:45

http://reply.papertrans.cn/23/2299/229879/229879_37.png

deactivate 发表于 2025-3-28 02:32:57

http://reply.papertrans.cn/23/2299/229879/229879_38.png

改进 发表于 2025-3-28 06:27:51

http://reply.papertrans.cn/23/2299/229879/229879_39.png

evaculate 发表于 2025-3-28 10:31:09

http://reply.papertrans.cn/23/2299/229879/229879_40.png
页: 1 2 3 [4] 5 6
查看完整版本: Titlebook: Combinatorial Algorithms; 29th International W Costas Iliopoulos,Hon Wai Leong,Wing-Kin Sung Conference proceedings 2018 Springer Internati