作者: 輕打 時間: 2025-3-21 22:06 作者: Platelet 時間: 2025-3-22 04:25
Exact Crossing Minimizationtudied extensively in the literature from a theoretic point of view and many bounds exist for a variety of graph classes. In this paper, we present the first algorithm able to compute the crossing number of general sparse graphs of moderate size and present computational results on a popular benchma作者: Gentry 時間: 2025-3-22 05:05 作者: WATER 時間: 2025-3-22 11:03
On Rectilinear Duals for Vertex-Weighted Plane Graphso |.| simple rectilinear regions, one for each vertex, such that two regions are adjacent if and only if the corresponding vertices are connected by an edge in .. A rectilinear dual is called a cartogram if the area of each region is equal to the weight of the corresponding vertex. We show that ever作者: exhilaration 時間: 2025-3-22 14:38
Bar ,-Visibility Graphs: Bounds on the Number of Edges, Chromatic Number, and Thicknessf there exists a one-to-one correspondence between vertices of . and bars in ., such that there is an edge between two vertices in . if and only if there exists an unobstructed vertical line of sight between their corresponding bars. If bars are allowed to see through each other, the graphs represen作者: exhilaration 時間: 2025-3-22 20:26 作者: 叫喊 時間: 2025-3-22 23:45
Volume Requirements of 3D Upward Drawingsare oriented in a common (upward) direction. We show that there exists a family of outerplanar directed acyclic graphs whose volume requirement is super-linear. We also prove that for the special case of rooted trees a linear volume upper bound is achievable.作者: 送秋波 時間: 2025-3-23 04:46 作者: 摘要 時間: 2025-3-23 06:57 作者: 水獺 時間: 2025-3-23 09:49 作者: 柔美流暢 時間: 2025-3-23 17:36 作者: 千篇一律 時間: 2025-3-23 20:05
Transversal Structures on Triangulations, with Application to Straight-Line Drawingthe regular edge labeling discovered by Kant and He. We study other properties of this structure and show that it gives rise to a new straight-line drawing algorithm for triangulations without non empty triangles, and more generally for 4-connected plane graphs with at least 4 border vertices. Takin作者: Judicious 時間: 2025-3-23 22:40 作者: debble 時間: 2025-3-24 02:51
Two Trees Which Are Self–intersecting When Drawn Simultaneouslyhe goal is to simultaneously find a nice drawing for both of the sets. It has been found out that only restricted classes of planar graphs can be drawn simultaneously using straight lines and without crossings within the same edge set. In this paper, we negatively answer one of the most often posted作者: 小蟲 時間: 2025-3-24 08:11 作者: ABOUT 時間: 2025-3-24 14:35 作者: Hyperalgesia 時間: 2025-3-24 16:48
Brian Henderson,David J. Kinahan,Jens Ducréetudied extensively in the literature from a theoretic point of view and many bounds exist for a variety of graph classes. In this paper, we present the first algorithm able to compute the crossing number of general sparse graphs of moderate size and present computational results on a popular benchma作者: Allege 時間: 2025-3-24 19:25
https://doi.org/10.1007/978-3-030-96462-7ycle . of .. Is it possible to draw?. as a non-intersecting closed curve inside ., following the circles that correspond in . to the vertices of . and the strips that connect them? We show that this test can be done in polynomial time and study this problem in the framework of clustered planarity fo作者: 宴會 時間: 2025-3-25 00:39 作者: Externalize 時間: 2025-3-25 04:06 作者: 煉油廠 時間: 2025-3-25 10:21 作者: neoplasm 時間: 2025-3-25 15:00
Stability Issues in Microgrids,are oriented in a common (upward) direction. We show that there exists a family of outerplanar directed acyclic graphs whose volume requirement is super-linear. We also prove that for the special case of rooted trees a linear volume upper bound is achievable.作者: 物種起源 時間: 2025-3-25 18:52 作者: 晚來的提名 時間: 2025-3-25 22:49
https://doi.org/10.1007/978-3-031-13359-6 of ., is the classical graph parameter ..(.). By restricting the edges to be straight, we obtain the ..(G). By further restricting the vertices to be in convex position, we obtain the ..(G). This paper studies the relationship between these parameters and the treewidth of .. Let . denote the maximu作者: 滔滔不絕地說 時間: 2025-3-26 01:22 作者: A保存的 時間: 2025-3-26 07:57 作者: Thymus 時間: 2025-3-26 09:44 作者: 遭遇 時間: 2025-3-26 13:39 作者: Cacophonous 時間: 2025-3-26 17:06
Low power microhotplate as basic cellhe goal is to simultaneously find a nice drawing for both of the sets. It has been found out that only restricted classes of planar graphs can be drawn simultaneously using straight lines and without crossings within the same edge set. In this paper, we negatively answer one of the most often posted作者: Ascribe 時間: 2025-3-26 22:59
Morphing Planar Graphs While Preserving Edge Directionse drawings of the transformation remain simple and parallel with . (and .)? We prove that a transformation can always be found in the case of orthogonal drawings; however, when edges are allowed to be in one of three or more slopes the problem becomes NP-hard.作者: 牢騷 時間: 2025-3-27 01:39
On Rectilinear Duals for Vertex-Weighted Plane Graphsn edge in .. A rectilinear dual is called a cartogram if the area of each region is equal to the weight of the corresponding vertex. We show that every vertex-weighted plane triangulated graph . admits a cartogram of constant complexity, that is, a cartogram where the number of vertices of each region is constant.作者: 招致 時間: 2025-3-27 05:17 作者: 絆住 時間: 2025-3-27 11:06
Two Trees Which Are Self–intersecting When Drawn Simultaneouslyn simultaneously using straight lines and without crossings within the same edge set. In this paper, we negatively answer one of the most often posted open questions namely whether any two trees with the same vertex set can be drawn simultaneously crossing-free in a straight line way.作者: tooth-decay 時間: 2025-3-27 15:43
Brian Henderson,David J. Kinahan,Jens Ducréerk set of graphs. The approach uses a new integer linear programming formulation of the problem combined with strong heuristics and problem reduction techniques. This enables us to compute the crossing number for 91 percent of all graphs on up to 40 nodes in the benchmark set within a time limit of five minutes per graph.作者: buoyant 時間: 2025-3-27 20:59 作者: Arthropathy 時間: 2025-3-28 01:16
Exact Crossing Minimizationrk set of graphs. The approach uses a new integer linear programming formulation of the problem combined with strong heuristics and problem reduction techniques. This enables us to compute the crossing number for 91 percent of all graphs on up to 40 nodes in the benchmark set within a time limit of five minutes per graph.作者: Inflated 時間: 2025-3-28 04:32
Small Area Drawings of Outerplanar Graphserplanar drawings of general outerplanar graphs with .(..) area. Further, we study the interplay between the area requirements of the drawings of an outerplanar graph and the area requirements of a special class of drawings of its dual tree.作者: GROG 時間: 2025-3-28 08:05
https://doi.org/10.1007/978-981-33-4876-9e drawings of the transformation remain simple and parallel with . (and .)? We prove that a transformation can always be found in the case of orthogonal drawings; however, when edges are allowed to be in one of three or more slopes the problem becomes NP-hard.作者: 頑固 時間: 2025-3-28 10:44
Contact Information Microformat: Hcardn edge in .. A rectilinear dual is called a cartogram if the area of each region is equal to the weight of the corresponding vertex. We show that every vertex-weighted plane triangulated graph . admits a cartogram of constant complexity, that is, a cartogram where the number of vertices of each region is constant.作者: 本能 時間: 2025-3-28 17:48
The Case of Combined Magnetic Fielduse. In this article, we present a hybrid model that combines the two techniques. This is accomplished by 2.5D drawings which are calculated in an incremental way. The method has been evaluated on collaboration networks.作者: synovial-joint 時間: 2025-3-28 21:50 作者: 逃避系列單詞 時間: 2025-3-28 23:08 作者: Habituate 時間: 2025-3-29 07:01 作者: 冷淡周邊 時間: 2025-3-29 07:13 作者: 不再流行 時間: 2025-3-29 14:36 作者: EWER 時間: 2025-3-29 17:18
Miscellaneous Asymptotics of Spectraly worse theoretical complexity. We compare our method with convex quadratic optimization and force scan approaches and find that it is faster than either, gives results of better quality than force scan methods and similar quality to the quadratic optimisation approach.作者: 地殼 時間: 2025-3-29 22:36 作者: Abominate 時間: 2025-3-30 01:59
Crossings and Permutationsow the NP-hardness of the common and the max version for . ≥ 4 permutations (and . even), and establish a 2-2/. and a 2-approximation, respectively. For two permutations crossing minimization is solved by inspecting the drawings, whereas it remains open for three permutations.作者: 有抱負者 時間: 2025-3-30 04:14
Bar ,-Visibility Graphs: Bounds on the Number of Edges, Chromatic Number, and Thicknesser of edges in a bar .-visibility graph. As a consequence, we obtain an upper bound of 12 on the chromatic number of bar 1-visibility graphs, and a tight upper bound of 8 on the size of the largest complete bar 1-visibility graph. We conjecture that bar 1-visibility graphs have thickness at most 2.作者: Apraxia 時間: 2025-3-30 10:33
Fast Node Overlap Removally worse theoretical complexity. We compare our method with convex quadratic optimization and force scan approaches and find that it is faster than either, gives results of better quality than force scan methods and similar quality to the quadratic optimisation approach.作者: Armory 時間: 2025-3-30 12:25 作者: DEAWL 時間: 2025-3-30 18:14
Graph Drawing978-3-540-31667-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: tolerance 時間: 2025-3-30 23:59 作者: Habituate 時間: 2025-3-31 02:05 作者: Ornament 時間: 2025-3-31 08:43
https://doi.org/10.1007/978-3-642-80343-7The upward planarity testing problem is known to be NP-hard. We describe an .(..)-time upward planarity testing and embedding algorithm for the class of digraphs that do not contain rigid triconnected components. We also present a new FPT algorithm that solves the upward planarity testing and embedding problem for general digraphs.作者: 跑過 時間: 2025-3-31 09:50
Standard Theory in Dimensions 2 and 3We generalize the . graphs to a broader class of graphs called Δ. graphs. This class of graphs and distance-hereditary graphs, a well-known class of graphs, coincide. Some results about the visualization of Δ-confluent graphs are also given.作者: ureter 時間: 2025-3-31 13:23
Dynamic Spectral Layout of Small WorldsSpectral methods are naturally suited for dynamic graph layout, because moderate changes of a graph yield moderate changes of the layout under weak assumptions. We discuss some general principles for dynamic graph layout and derive a dynamic spectral layout approach for the animation of small-world models.作者: interrogate 時間: 2025-3-31 20:58
Drawing , , in Three Dimensions with One Bend Per EdgeWe give a drawing of .. in 3D in which vertices are placed at integer grid points and edges are drawn crossing-free with at most one bend per edge in a volume bounded by .(..).作者: 偏狂癥 時間: 2025-4-1 00:14 作者: 招致 時間: 2025-4-1 03:28
Delta-Confluent DrawingsWe generalize the . graphs to a broader class of graphs called Δ. graphs. This class of graphs and distance-hereditary graphs, a well-known class of graphs, coincide. Some results about the visualization of Δ-confluent graphs are also given.作者: Vldl379 時間: 2025-4-1 07:12
https://doi.org/10.1007/978-3-030-96462-7ycle . of .. Is it possible to draw?. as a non-intersecting closed curve inside ., following the circles that correspond in . to the vertices of . and the strips that connect them? We show that this test can be done in polynomial time and study this problem in the framework of clustered planarity for highly non-connected clustered graphs.作者: Graduated 時間: 2025-4-1 10:41
