書目名稱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é)科排名
作者: 高腳酒杯 時(shí)間: 2025-3-21 22:48 作者: Sleep-Paralysis 時(shí)間: 2025-3-22 04:13
On the?Biplanarity of?Blowups biplanar drawings of 2-blowups of planar graphs whose duals have two-path induced path partitions, and drawings with split thickness two of 2-blowups of 3-chromatic planar graphs, and of graphs that can be decomposed into a Hamiltonian path and a dual Hamiltonian path.作者: FLACK 時(shí)間: 2025-3-22 06:54 作者: 入會(huì) 時(shí)間: 2025-3-22 11:16
Midwifery, Childbirth and the Mediahose that are implied by the above rules. In particular, the classes of .-string graphs and .-string graphs are incomparable by inclusion for any ., and the class of .-string graphs is not contained in the class of .-string graphs for any?..作者: restrain 時(shí)間: 2025-3-22 15:16 作者: restrain 時(shí)間: 2025-3-22 20:53 作者: Freeze 時(shí)間: 2025-3-22 21:41 作者: endure 時(shí)間: 2025-3-23 01:42
String Graphs with?Precise Number of?Intersectionshose that are implied by the above rules. In particular, the classes of .-string graphs and .-string graphs are incomparable by inclusion for any ., and the class of .-string graphs is not contained in the class of .-string graphs for any?..作者: orthodox 時(shí)間: 2025-3-23 07:20 作者: BADGE 時(shí)間: 2025-3-23 13:41
The Complexity of?Recognizing Geometric Hypergraphslfspaces in .. We study the families of translates of balls and ellipsoids in ., as well as of other convex sets, and show that their . problems are also .-complete. This means that these recognition problems are equivalent to deciding whether a multivariate system of polynomial equations with integer coefficients has a real solution.作者: ALE 時(shí)間: 2025-3-23 17:09 作者: anthropologist 時(shí)間: 2025-3-23 19:42 作者: Lucubrate 時(shí)間: 2025-3-23 23:21 作者: 割公牛膨脹 時(shí)間: 2025-3-24 04:36
https://doi.org/10.1007/978-3-031-48565-7. We disprove a conjecture of Gethner that 2-blowups of planar graphs are biplanar: iterated Kleetopes are counterexamples. Additionally, we construct biplanar drawings of 2-blowups of planar graphs whose duals have two-path induced path partitions, and drawings with split thickness two of 2-blowups作者: Tracheotomy 時(shí)間: 2025-3-24 09:49 作者: 進(jìn)步 時(shí)間: 2025-3-24 12:31
https://doi.org/10.1007/978-3-031-18432-1r of edges can only cross at a right angle, has at most . edges for .. This improves upon the previous upper bound of 74.2.; this is the first improvement in more than 12 years. A crucial ingredient of the proof is an upper bound on the size of plane multigraphs with polyline edges in which the firs作者: 肉身 時(shí)間: 2025-3-24 14:53
Midwifery, Childbirth and the Media intersects in at most . points. We introduce the class of .-string graphs as a further restriction of .-string graphs by requiring that every two curves intersect in either zero or precisely . points. We study the hierarchy of these graphs, showing that for any ., .-string graphs are a subclass of 作者: Limerick 時(shí)間: 2025-3-24 22:47
Midwives, Research and Childbirtharcs and multiple edges passing through the same point are counted as a single crossing. Interpreting each crossing as a cross-cap induces an embedding into a non-orientable surface. In 2007, Mohar showed that the degenerate crossing number of a graph is at most its non-orientable genus and he conje作者: Cholecystokinin 時(shí)間: 2025-3-25 01:05
Midwives, Research and Childbirth satisfy some property that is useful for graph visualization. We propose investigating a property where each edge is not crossed in at least one drawing in the collection. We call such collection .. This property is motivated by a quintessential problem of the crossing number, where one asks for a 作者: Grievance 時(shí)間: 2025-3-25 06:15 作者: induct 時(shí)間: 2025-3-25 11:16 作者: HAUNT 時(shí)間: 2025-3-25 13:03 作者: GROG 時(shí)間: 2025-3-25 18:10
https://doi.org/10.1007/978-3-030-75239-2f a hypergraph ., each vertex . is associated with a point . and each hyperedge . is associated with a connected set . such that . for all .. We say that a given hypergraph . is . by some (infinite) family . of sets in ., if there exist . and . such that (.,?.) is a geometric representation of?.. Fo作者: Eosinophils 時(shí)間: 2025-3-25 23:07
https://doi.org/10.1007/978-3-319-78117-4ertices have perfect angular resolution, i.e., all angles incident to a vertex?. have size?.. We prove that it is .-complete to determine whether a given graph admits a Lombardi drawing respecting a fixed cyclic ordering of the incident edges around each vertex. In particular, this implies .-hardnes作者: Ingest 時(shí)間: 2025-3-26 00:18
https://doi.org/10.1007/978-3-030-97359-9ecifically, we extend upward drawings of unordered rooted trees where vertices have assigned heights by mapping each vertex to a column. Under an orthogonal drawing style and with every subtree within a column drawn planar, we consider different natural variants concerning the arrangement of subtree作者: 合唱團(tuán) 時(shí)間: 2025-3-26 05:41 作者: 注入 時(shí)間: 2025-3-26 10:15 作者: 聯(lián)想記憶 時(shí)間: 2025-3-26 14:27 作者: 胰臟 時(shí)間: 2025-3-26 17:28
String Graphs with?Precise Number of?Intersections intersects in at most . points. We introduce the class of .-string graphs as a further restriction of .-string graphs by requiring that every two curves intersect in either zero or precisely . points. We study the hierarchy of these graphs, showing that for any ., .-string graphs are a subclass of 作者: 公司 時(shí)間: 2025-3-26 23:29 作者: 沉思的魚 時(shí)間: 2025-3-27 05:03
Minimizing an?Uncrossed Collection of?Drawings satisfy some property that is useful for graph visualization. We propose investigating a property where each edge is not crossed in at least one drawing in the collection. We call such collection .. This property is motivated by a quintessential problem of the crossing number, where one asks for a 作者: 敬禮 時(shí)間: 2025-3-27 06:20 作者: Dissonance 時(shí)間: 2025-3-27 13:29 作者: 放肆的我 時(shí)間: 2025-3-27 15:31
On 3-Coloring Circle Graphsnd only if their endpoints are pairwise distinct and alternate in .. Therefore, the problem of determining whether . has a .-page book embedding with spine order?. is equivalent to deciding whether . can be colored with . colors. Finding a .-coloring for a circle graph is known to be NP-complete for作者: insurgent 時(shí)間: 2025-3-27 17:52
The Complexity of?Recognizing Geometric Hypergraphsf a hypergraph ., each vertex . is associated with a point . and each hyperedge . is associated with a connected set . such that . for all .. We say that a given hypergraph . is . by some (infinite) family . of sets in ., if there exist . and . such that (.,?.) is a geometric representation of?.. Fo作者: 心胸狹窄 時(shí)間: 2025-3-27 23:33
On the?Complexity of?Lombardi Graph Drawingertices have perfect angular resolution, i.e., all angles incident to a vertex?. have size?.. We prove that it is .-complete to determine whether a given graph admits a Lombardi drawing respecting a fixed cyclic ordering of the incident edges around each vertex. In particular, this implies .-hardnes作者: surmount 時(shí)間: 2025-3-28 04:25 作者: VEST 時(shí)間: 2025-3-28 09:38
https://doi.org/10.1007/978-1-349-15038-0We study two notions of fan-planarity introduced by (Cheong et al., GD22), called weak and strong fan-planarity, which separate two non-equivalent definitions of fan-planarity in the literature. We prove?that not every weakly fan-planar graph is strongly fan-planar, while the upper bound on the edge density is the same for both families.作者: TRAWL 時(shí)間: 2025-3-28 12:56
Weakly and?Strongly Fan-Planar GraphsWe study two notions of fan-planarity introduced by (Cheong et al., GD22), called weak and strong fan-planarity, which separate two non-equivalent definitions of fan-planarity in the literature. We prove?that not every weakly fan-planar graph is strongly fan-planar, while the upper bound on the edge density is the same for both families.作者: 取回 時(shí)間: 2025-3-28 16:38 作者: 直言不諱 時(shí)間: 2025-3-28 19:12 作者: bifurcate 時(shí)間: 2025-3-29 00:10 作者: Bridle 時(shí)間: 2025-3-29 04:35
: Drawing Graphs as?Celtic Knots and?Linksterconnectedness. This paper describes the framework . to draw graphs as Celtic knots and links. The drawing process raises interesting combinatorial concepts in the theory of circuits in planar graphs. Further, . uses a novel algorithm to represent edges as Bézier curves, aiming to show each link as a smooth curve with limited curvature.作者: FUSC 時(shí)間: 2025-3-29 07:59 作者: Lacunar-Stroke 時(shí)間: 2025-3-29 13:41 作者: Constituent 時(shí)間: 2025-3-29 18:21
Minimizing an?Uncrossed Collection of?Drawingsrawings in a collection, satisfying the uncrossed property. Second, the ., minimizes the total number of crossings in the collection that satisfy the uncrossed property. For both definitions, we establish initial results. We prove that the uncrossed crossing number is NP-hard, but there is an . algo作者: 消散 時(shí)間: 2025-3-29 21:22
On 3-Coloring Circle Graphsan) for details..In this paper we argue that Unger’s algorithm for 3-coloring circle graphs is not correct and that 3-coloring circle graphs should be considered as an open problem. We show that step (1) of Unger’s algorithm is incorrect by exhibiting a circle graph whose formula . is satisfiable bu作者: Mnemonics 時(shí)間: 2025-3-30 02:49 作者: Hemoptysis 時(shí)間: 2025-3-30 07:56 作者: 陶醉 時(shí)間: 2025-3-30 11:35 作者: Hormones 時(shí)間: 2025-3-30 15:28
