書目名稱Graph Drawing and Network Visualization影響因子(影響力)學(xué)科排名
書目名稱Graph Drawing and Network Visualization網(wǎng)絡(luò)公開度
書目名稱Graph Drawing and Network Visualization網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Graph Drawing and Network Visualization被引頻次
書目名稱Graph Drawing and Network Visualization被引頻次學(xué)科排名
書目名稱Graph Drawing and Network Visualization年度引用
書目名稱Graph Drawing and Network Visualization年度引用學(xué)科排名
書目名稱Graph Drawing and Network Visualization讀者反饋
書目名稱Graph Drawing and Network Visualization讀者反饋學(xué)科排名
作者: DEMUR 時間: 2025-3-21 22:28
https://doi.org/10.1057/9781137408921e FPT algorithms for the vertex cover number plus either of the first two parameters and for the number of cutvertices plus the maximum degree, whereas we prove all remaining combinations to be intractable.作者: 主動 時間: 2025-3-22 01:41
https://doi.org/10.1007/978-1-4757-5842-9. A third approach chooses the weight of each edge according to its depth in a spanning tree rooted at the outer vertices, such as a Schnyder wood or BFS tree, in order to pull vertices closer to the boundary.作者: 使入迷 時間: 2025-3-22 04:56
https://doi.org/10.1007/978-3-322-97509-6dge crossings. Each of the three steps is related to a well-studied, but .-complete computational problem. We combine and adapt suitable algorithmic approaches, implement them as an instantiation of our framework and show in a case study how it can be applied in a practical setting. Furthermore, we 作者: 手術(shù)刀 時間: 2025-3-22 12:34
Different Types of?Isomorphisms of?Drawings of?Complete Multipartite Graphstion system. We also show that most other implications – including the ones that hold for complete graphs – do not hold for complete multipartite graphs. Using this analysis, we establish which types of isomorphisms are meaningful for simple drawings of complete multipartite graphs.作者: 中和 時間: 2025-3-22 14:13
Parameterized Complexity of?Simultaneous Planaritye FPT algorithms for the vertex cover number plus either of the first two parameters and for the number of cutvertices plus the maximum degree, whereas we prove all remaining combinations to be intractable.作者: 中和 時間: 2025-3-22 20:23 作者: ostensible 時間: 2025-3-22 23:52 作者: 無可爭辯 時間: 2025-3-23 04:34 作者: A簡潔的 時間: 2025-3-23 07:44
https://doi.org/10.1007/978-1-4613-1225-3puzzles, 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.作者: lipids 時間: 2025-3-23 13:21 作者: 傻 時間: 2025-3-23 16:46
https://doi.org/10.1007/978-3-322-81174-5.-hard, even when we want to test the existence of a rectilinear planar drawing, i.e., an orthogonal drawing without bends (Garg and Tamassia, 2001). From the parameterized complexity perspective, the problem is fixed-parameter tractable when parameterized by the sum of three parameters: the number 作者: Meditate 時間: 2025-3-23 19:49 作者: Cacophonous 時間: 2025-3-23 23:01 作者: 兩種語言 時間: 2025-3-24 06:25 作者: gruelling 時間: 2025-3-24 07:14 作者: 過分自信 時間: 2025-3-24 12:20
https://doi.org/10.1007/978-1-349-18291-6a (crossing-free) straight-line embedding with vertices placed at points of .. A . is a set of planar graphs of the same order with no simultaneous embedding. A well-known open problem from 2007 posed by Brass, Cenek, Duncan, Efrat, Erten, Ismailescu, Kobourov, Lubiw and Mitchell, asks whether there作者: 粗魯性質(zhì) 時間: 2025-3-24 16:07
https://doi.org/10.1007/978-1-4757-5842-9-graph embeddings are weighted versions of Tutte embeddings, where solving a linear system places vertices at a minimum-energy configuration for a system of springs. A major drawback of the unweighted Tutte embedding is that it often results in drawings with exponential area. We present a number of 作者: ARK 時間: 2025-3-24 20:31 作者: 謙卑 時間: 2025-3-25 02:56
https://doi.org/10.1007/978-3-322-93701-8ultigraphs orthogonally, using few bends, few crossings, and small area. Our pipeline computes an initial graph layout, then removes overlaps between the rectangular nodes, routes the edges, orders the edges, and nudges them, that is, moves edge segments in order to balance the inter-edge distances.作者: 連接 時間: 2025-3-25 04:02
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 作者: REP 時間: 2025-3-25 11:55 作者: 顛簸下上 時間: 2025-3-25 19:01
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
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 作者: 四牛在彎曲 時間: 2025-3-26 05:20 作者: 摻假 時間: 2025-3-26 10:56
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作者: 遠(yuǎn)地點 時間: 2025-3-26 14:54
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
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作者: Bravado 時間: 2025-3-26 21:31
A Logarithmic Bound for?Simultaneous Embeddings of?Planar Graphsa (crossing-free) straight-line embedding with vertices placed at points of .. A . is a set of planar graphs of the same order with no simultaneous embedding. A well-known open problem from 2007 posed by Brass, Cenek, Duncan, Efrat, Erten, Ismailescu, Kobourov, Lubiw and Mitchell, asks whether there作者: 使混合 時間: 2025-3-27 02:37 作者: Conserve 時間: 2025-3-27 06:53
Computing Hive Plots: A Combinatorial Frameworkconnecting their respective endpoints. In previous work on hive plots, assignment to an axis and vertex positions on each axis were determined based on selected vertex attributes and the order of axes was prespecified. Here, we present a new framework focusing on combinatorial aspects of these drawi作者: 有其法作用 時間: 2025-3-27 10:56 作者: Creditee 時間: 2025-3-27 14:04
Parameterized and?Approximation Algorithms for?the?Maximum Bimodal Subgraph Problemigraph 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.作者: Cytokines 時間: 2025-3-27 20:53 作者: Narrative 時間: 2025-3-27 23:43 作者: 極少 時間: 2025-3-28 06:03
Migration in Irish History 1607-2007 of RAC drawings from the viewpoint of parameterized complexity. In particular, we establish that computing a RAC drawing of an input graph . with at most . bends (or determining that none exists) is fixed-parameter tractable parameterized by either the feedback edge number of ., or . plus the vertex cover number of ..作者: 艦旗 時間: 2025-3-28 09:19 作者: CLOT 時間: 2025-3-28 10:51 作者: 可憎 時間: 2025-3-28 18:10
Cops and?Robbers on?1-Planar Graphsat most one crossing per edge. In contrast to planar graphs, we show that some 1-planar graphs have unbounded cop number. Meanwhile, for maximal 1-planar graphs, we prove that three cops are always sufficient and sometimes necessary. In addition, we completely determine the cop number of outer 1-planar graphs.作者: mediocrity 時間: 2025-3-28 20:17
Fixed-Parameter Algorithms for?Computing RAC Drawings of?Graphs of RAC drawings from the viewpoint of parameterized complexity. In particular, we establish that computing a RAC drawing of an input graph . with at most . bends (or determining that none exists) is fixed-parameter tractable parameterized by either the feedback edge number of ., or . plus the vertex cover number of ..作者: Ascendancy 時間: 2025-3-29 00:01 作者: bronchodilator 時間: 2025-3-29 04:15
Upward and?Orthogonal Planarity are W[1]-Hard Parameterized by?Treewidthblems. We prove that the flow problem is W[1]-hard parameterized by treewidth on planar graphs, and that the existing chain of reductions to the planarity testing problems can be adapted without blowing up the treewidth. Our reductions also show that the known .-time algorithms cannot be improved to run in time?. unless . fails.作者: 吹牛大王 時間: 2025-3-29 08:41
https://doi.org/10.1007/978-3-322-81174-5 showing that the problem remains fixed-parameter tractable when parameterized only by the number of vertices of degree at most two plus the number of bends. As a consequence, rectilinear planarity testing lies in .?parameterized by the number of vertices of degree at most two.作者: Serenity 時間: 2025-3-29 12:46
https://doi.org/10.1007/978-3-658-29887-6le with respect to each of the following parameters: the vertex cover number, the segment number, and the line cover number. We also consider colored versions of the segment and the line cover number.作者: LAITY 時間: 2025-3-29 16:54
https://doi.org/10.1007/978-3-322-93701-8 on linear programming, (ii)?a selection of simple algorithms that together produce competitive results, and (iii)?an extensive experimental comparison of our pipeline with existing approaches using standard benchmark sets and metrics.作者: 大炮 時間: 2025-3-29 20:50
https://doi.org/10.1007/978-3-658-13147-0terized by the branchwidth (and hence by the treewidth) of the graph; (ii) we establish that MBS parameterized by the number of non-bimodal vertices admits a polynomial kernel. As the byproduct of these results, we obtain a subexponential FPT algorithm and an efficient polynomial-time approximation scheme for MBS.作者: 600 時間: 2025-3-30 02:14 作者: FRAUD 時間: 2025-3-30 04:29 作者: intrude 時間: 2025-3-30 09:54 作者: 嚴(yán)厲批評 時間: 2025-3-30 15:36
Parameterized and?Approximation Algorithms for?the?Maximum Bimodal Subgraph Problemterized by the branchwidth (and hence by the treewidth) of the graph; (ii) we establish that MBS parameterized by the number of non-bimodal vertices admits a polynomial kernel. As the byproduct of these results, we obtain a subexponential FPT algorithm and an efficient polynomial-time approximation scheme for MBS.作者: aspect 時間: 2025-3-30 17:17
https://doi.org/10.1007/978-1-349-18291-6ich was recently established by Goenka, Semnani and Yip..We also give a computer-free proof that there exists a conflict collection of size 30, improving on the previously smallest known conflict collection of size 49 which was found using heavy computer assistance.作者: 靈敏 時間: 2025-3-30 21:40
A Logarithmic Bound for?Simultaneous Embeddings of?Planar Graphsich was recently established by Goenka, Semnani and Yip..We also give a computer-free proof that there exists a conflict collection of size 30, improving on the previously smallest known conflict collection of size 49 which was found using heavy computer assistance.作者: 填滿 時間: 2025-3-31 03:43
Graph Drawing and Network Visualization978-3-031-49275-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: SLAY 時間: 2025-3-31 08:46
