连接
发表于 2025-3-25 04:02:19
https://doi.org/10.1007/978-3-658-13147-0igraph is bimodal if all its vertices are bimodal. Bimodality is at the heart of many types of graph layouts, such as upward drawings, level-planar drawings, and L-drawings. If the graph is not bimodal, the . problem asks for an embedding-preserving bimodal subgraph with the maximum number of edges.
烦扰
发表于 2025-3-25 11:02:59
http://reply.papertrans.cn/39/3880/387921/387921_22.png
REP
发表于 2025-3-25 11:55:27
http://reply.papertrans.cn/39/3880/387921/387921_23.png
颠簸下上
发表于 2025-3-25 19:01:39
Removing Popular Faces in Curve Arrangementspuzzles, we investigate possibilities to eliminate the popular faces in an arrangement by inserting a single additional curve. This turns out to be .-hard; however, it becomes tractable when the number of popular faces is small: We present a probabilistic .-approach in the number of popular faces.
Baffle
发表于 2025-3-25 20:21:28
Different Types of Isomorphisms of Drawings of Complete Multipartite Graphsntersects itself. We analyze several characteristics of simple drawings of complete multipartite graphs: which pairs of edges cross, in which order they cross, and the cyclic order around vertices and crossings, respectively. We consider all possible combinations of how two drawings can share some c
我们的面粉
发表于 2025-3-26 01:10:53
http://reply.papertrans.cn/39/3880/387921/387921_26.png
四牛在弯曲
发表于 2025-3-26 05:20:33
http://reply.papertrans.cn/39/3880/387921/387921_27.png
掺假
发表于 2025-3-26 10:56:11
Parameterized Complexity of Simultaneous Planarityut graph such that all drawings coincide on .. While . is still open for the case of two input graphs, the problem is NP-complete for . [.]..In this work, we explore the parameterized complexity of .. We show that . is FPT with respect to . plus the vertex cover number or the feedback edge set numbe
远地点
发表于 2025-3-26 14:54:13
The Parametrized Complexity of the Segment Numbermber of segments that can be achieved by any planar straight-line drawing of .. The . of . is the minimum number of lines that support all the edges of a planar straight-line drawing of .. Computing the segment number or the line cover number of a planar graph is .-complete and, thus, NP-hard. We st
META
发表于 2025-3-26 19:14:17
A Schnyder-Type Drawing Algorithm for 5-Connected Triangulationsangulations. The combinatorial structures have three incarnations defined in terms of orientations, corner-labelings, and woods respectively. The wood incarnation consists in 5 spanning trees crossing each other in an orderly fashion. Similarly as for Schnyder woods on triangulations, it induces, fo