CORE
发表于 2025-3-28 16:22:21
http://reply.papertrans.cn/39/3880/387914/387914_41.png
褪色
发表于 2025-3-28 21:49:25
A Short Proof of the Non-biplanarity of Battle, Harary, and Kodama (1962) and independently Tutte (1963) proved that the complete graph with nine vertices is not biplanar. Aiming towards simplicity and brevity, in this note we provide a short proof of this claim.
慷慨援助
发表于 2025-3-29 00:46:40
One-Bend Drawings of Outerplanar Graphs Inside Simple PolygonsWe consider the problem of drawing an outerplanar graph with . vertices with at most one bend per edge if the outer face is already drawn as a simple polygon. We prove that it can be decided in .(.) time if such a drawing exists, where . is the number of interior edges. In the positive case, we can also compute such a drawing.
MUTED
发表于 2025-3-29 05:13:45
Ralph T. Manktelow M.D., F.R.C.S.(C)torus. Barycentric interpolation cannot be applied directly in this setting, because the linear systems defining intermediate vertex positions are not necessarily solvable. We describe a simple scaling strategy that circumvents this issue. Computing the appropriate scaling requires . time, after whi
改正
发表于 2025-3-29 07:49:23
http://reply.papertrans.cn/39/3880/387914/387914_45.png
浮雕宝石
发表于 2025-3-29 12:19:41
Planar and Toroidal Morphs Made Easiertorus. Barycentric interpolation cannot be applied directly in this setting, because the linear systems defining intermediate vertex positions are not necessarily solvable. We describe a simple scaling strategy that circumvents this issue. Computing the appropriate scaling requires . time, after whi
infinite
发表于 2025-3-29 17:11:54
Planar Straight-Line Realizations of 2-Trees with Prescribed Edge Lengthsthermore, we consider the . problem for weighted maximal outerplanar graphs and prove it to be linear-time solvable if their dual tree is a path, and cubic-time solvable if their dual tree is a caterpillar. Finally, we prove that the . problem for weighted 2-trees is slice-wise polynomial in the len
高原
发表于 2025-3-29 20:10:06
1865-0929 ld in Kaunas, Lithuania, in October 2013. The 34 papers presented were carefully reviewed and selected from 60 submissions. The papers focus on the following topics: information systems, business intelligence, software engineering, and IT applications.978-3-642-41946-1978-3-642-41947-8Series ISSN 18
crease
发表于 2025-3-30 03:09:46
http://reply.papertrans.cn/39/3880/387914/387914_49.png
Transfusion
发表于 2025-3-30 04:02:52
http://reply.papertrans.cn/39/3880/387914/387914_50.png