作者: Tonometry 時(shí)間: 2025-3-21 23:13 作者: Arable 時(shí)間: 2025-3-22 00:24
Caroline Chénard,Federico M. Lauro. We add two (.) patterns for trees to the previous set of tree patterns given by Healy .. [4]. Neither of these patterns match any of the previous patterns. We show that this new set of patterns completely characterizes level planar trees.作者: 幼稚 時(shí)間: 2025-3-22 05:54 作者: 釘牢 時(shí)間: 2025-3-22 09:24 作者: Conjuction 時(shí)間: 2025-3-22 14:14 作者: Conjuction 時(shí)間: 2025-3-22 17:35 作者: instructive 時(shí)間: 2025-3-22 21:49 作者: 撕裂皮肉 時(shí)間: 2025-3-23 03:05 作者: 喃喃而言 時(shí)間: 2025-3-23 08:11 作者: badinage 時(shí)間: 2025-3-23 11:54
Khem Chand Saini,Sanjeeva Nayaka,Felix BastWe prove that the crossing number of a graph decays in a “continuous fashion” in the following sense. For any .>?0 there is a .>?0 such that for . sufficiently large, every graph . with . vertices and .?≥?.. edges has a subgraph .′ of at most (1???.). edges and crossing number at least .. This generalizes the result of J. Fox and Cs. Tóth.作者: 清楚說話 時(shí)間: 2025-3-23 16:46 作者: 壟斷 時(shí)間: 2025-3-23 18:23
https://doi.org/10.1007/978-2-8178-0922-9We describe a practical method to test a leveled graph for level planarity and provide a level planar layout of the graph if the test succeeds, all in quadratic running-time. Embedding constraints restricting the order of incident edges around the vertices are allowed.作者: Embolic-Stroke 時(shí)間: 2025-3-23 22:24
Computing Symmetries of Combinatorial ObjectsWe survey the practical aspects of computing the symmetries (automorphisms) of combinatorial objects. These include all manner of graphs with adornments, matrices, point sets, etc.. Since automorphisms are just isomorphisms from an object to itself, the problem is intimately related to that of finding isomorphisms between two objects.作者: Calculus 時(shí)間: 2025-3-24 05:00 作者: AWE 時(shí)間: 2025-3-24 08:57 作者: 先驅(qū) 時(shí)間: 2025-3-24 13:07
Practical Level Planarity Testing and Layout with Embedding ConstraintsWe describe a practical method to test a leveled graph for level planarity and provide a level planar layout of the graph if the test succeeds, all in quadratic running-time. Embedding constraints restricting the order of incident edges around the vertices are allowed.作者: TSH582 時(shí)間: 2025-3-24 16:16 作者: NOMAD 時(shí)間: 2025-3-24 21:57
Crossing Number of Graphs with Rotation Systems Hliněny’s result, that computing the crossing number of a cubic graph (without rotation system) is .-complete. We also investigate the special case of multigraphs with rotation systems on a fixed number . of vertices. For .?=?1 and .?=?2 the crossing number can be computed in polynomial time and ap作者: 艦旗 時(shí)間: 2025-3-24 23:56 作者: 我悲傷 時(shí)間: 2025-3-25 04:43
Crossing Numbers and Parameterized Complexityizing the odd crossing number of . that uses at most 9. crossings, where . is the odd crossing number of .. As a consequence of this and a result of Grohe we can show that the odd crossing number is fixed-parameter tractable.作者: 金哥占卜者 時(shí)間: 2025-3-25 10:34 作者: 載貨清單 時(shí)間: 2025-3-25 15:11 作者: auxiliary 時(shí)間: 2025-3-25 18:13 作者: Focus-Words 時(shí)間: 2025-3-25 22:38
Polynomial Area Bounds for MST Embeddings of Treesng tree in the Euclidean plane. They derived area bounds of . for trees of height . and conjectured that an improvement below .. ×.. is not possible for some constant .?>?0. We partially disprove this conjecture by giving polynomial area bounds for arbitrary trees of maximal degree 3 and 4.作者: Gum-Disease 時(shí)間: 2025-3-26 00:49
Moving Vertices to Make Drawings Planekly as possible by moving vertices. In this paper we investigate the related problem . which asks for the minimum number of vertex moves. First, we show that . is NP-hard and hard to approximate. Second, we establish a connection to the graph-drawing problem ., which yields similar results for that 作者: GLARE 時(shí)間: 2025-3-26 07:37
Point-Set Embedding of Trees with Edge Constraintsinct point of .. A . is a point-set embedding with no edge bends. This paper studies the following problem: The input is a set . of . points, a planar graph . with . vertices, and a geometric point-set embedding of a subgraph .′???. on a subset of .. The desired output is a point-set embedding of . 作者: peptic-ulcer 時(shí)間: 2025-3-26 11:18 作者: 象形文字 時(shí)間: 2025-3-26 15:41
The Complexity of Several Realizability Problems for Abstract Topological Graphslane in such a way that each pair of edges from . crosses exactly once and no other pair crosses. We present a polynomial algorithm which decides whether a given complete AT-graph is simply realizable. On the other hand, we show that other similar realizability problems for (complete) AT-graphs are 作者: facetious 時(shí)間: 2025-3-26 18:07
Efficient Extraction of Multiple Kuratowski Subdivisionsdern planarity testing algorithms allow to extract a single such witness in linear time. We present the first linear time algorithm which is able to extract multiple Kuratowski subdivisions at once. This is of particular interest for, e.g., Branch-and-Cut algorithms which require multiple such subdi作者: 使隔離 時(shí)間: 2025-3-26 21:51 作者: altruism 時(shí)間: 2025-3-27 01:22
Matched Drawings of Planar Graphs the concept of such matched drawings, which are a relaxation of simultaneous geometric embeddings with mapping. We study which classes of graphs allow matched drawings and show that (.) two 3-connected planar graphs or a 3-connected planar graph and a tree may not be matched drawable, while (.) two作者: Outwit 時(shí)間: 2025-3-27 06:58 作者: LAST 時(shí)間: 2025-3-27 12:51 作者: DOTE 時(shí)間: 2025-3-27 15:17
Gábor Tarcali,Gy?rgy J. K?vics,Emese Kissedges; or equivalently, there is an edge that crosses .(../..) other edges. We strengthen the Crossing Lemma for drawings in which any two edges cross in at most .(1) points..We prove for every . that every graph . with . vertices and .?≥?3. edges drawn in the plane such that any two edges intersect作者: 修飾語 時(shí)間: 2025-3-27 19:16
Jhasketan Badhai,Sushanta Deb,Subrata K. Dasizing the odd crossing number of . that uses at most 9. crossings, where . is the odd crossing number of .. As a consequence of this and a result of Grohe we can show that the odd crossing number is fixed-parameter tractable.作者: 構(gòu)想 時(shí)間: 2025-3-27 22:40
The Evolution of Fungal Diversity,or any of the .! possible mappings. These graphs are equivalent to the set of unlabeled level planar (.) graphs that are level planar over all possible labelings. Our contributions are twofold. First, we provide linear time drawing algorithms for . graphs. Second, we provide a complete characterizat作者: 昏暗 時(shí)間: 2025-3-28 04:50 作者: 上釉彩 時(shí)間: 2025-3-28 06:30 作者: Commission 時(shí)間: 2025-3-28 12:02
Microbial Biosensors for Metal(loid)sng tree in the Euclidean plane. They derived area bounds of . for trees of height . and conjectured that an improvement below .. ×.. is not possible for some constant .?>?0. We partially disprove this conjecture by giving polynomial area bounds for arbitrary trees of maximal degree 3 and 4.作者: organism 時(shí)間: 2025-3-28 15:14
Cristiano G. Moreira,Vanessa Sperandiokly as possible by moving vertices. In this paper we investigate the related problem . which asks for the minimum number of vertex moves. First, we show that . is NP-hard and hard to approximate. Second, we establish a connection to the graph-drawing problem ., which yields similar results for that 作者: Perigee 時(shí)間: 2025-3-28 21:36 作者: 配偶 時(shí)間: 2025-3-28 23:24 作者: Substance 時(shí)間: 2025-3-29 04:27
Isao Karube,Atsushi Seki,Koji Sodelane in such a way that each pair of edges from . crosses exactly once and no other pair crosses. We present a polynomial algorithm which decides whether a given complete AT-graph is simply realizable. On the other hand, we show that other similar realizability problems for (complete) AT-graphs are 作者: 極力證明 時(shí)間: 2025-3-29 08:21 作者: 散開 時(shí)間: 2025-3-29 12:12
https://doi.org/10.1007/978-81-322-2598-0ects (a so-called ., e.g., a set of disks or homothetic triangles). We insist that the interiors of the seeds and the cover elements are pairwise disjoint, but they can touch. We call the contact graph of a cover a . (CCG). We are interested in two types of tasks: (a)?deciding whether a given seed s作者: Obscure 時(shí)間: 2025-3-29 15:36
Jyoti Kushwah,Vishal Singh Somvanshi the concept of such matched drawings, which are a relaxation of simultaneous geometric embeddings with mapping. We study which classes of graphs allow matched drawings and show that (.) two 3-connected planar graphs or a 3-connected planar graph and a tree may not be matched drawable, while (.) two作者: graphy 時(shí)間: 2025-3-29 21:47
Merit del Rocío Mora-Ruiz,Carlos Díaz-Gilsent are the first algorithms achieving sub-quadratic area for these problems. Further, for upward order-preserving straight-line orthogonal drawings of binary trees and for order-preserving straight-line orthogonal drawings of ternary trees we provide .(..) area lower bounds, that we also prove to be tight.作者: Ancestor 時(shí)間: 2025-3-30 03:23 作者: triptans 時(shí)間: 2025-3-30 04:56
Microbial Enzymes and Biotechniques of those hypergraphs which are representable by contact of segments in the plane, We propose some possible generalization directions and open problems, related to the order dimension of the incidence posets of hypergraphs.作者: patriot 時(shí)間: 2025-3-30 08:20 作者: verdict 時(shí)間: 2025-3-30 15:40
Point-Set Embedding of Trees with Edge Constraintson . that includes the given partial drawing of .′. We concentrate on trees and show how to compute the output in .(.. log.) time and with at most 1?+?2 ?./2 ? bends per edge, where . is the number of vertices of the given subdrawing. We also prove that there are instances of the problem which require at least .???3 bends for some of the edges.作者: 啞劇 時(shí)間: 2025-3-30 20:11
Representation of Planar Hypergraphs by Contacts of Triangles of those hypergraphs which are representable by contact of segments in the plane, We propose some possible generalization directions and open problems, related to the order dimension of the incidence posets of hypergraphs.作者: 尖酸一點(diǎn) 時(shí)間: 2025-3-30 23:16
https://doi.org/10.1007/978-81-322-2598-0lgorithms for the case that seeds are points and covers are disks or triangles. We show that the problem becomes NP-hard if seeds and covers are disks. Concerning task?(b) we show that it is even NP-hard for point seeds and disk covers (given a fixed correspondence between vertices and seeds).作者: 繁重 時(shí)間: 2025-3-31 02:53 作者: nutrients 時(shí)間: 2025-3-31 06:35
Crossing Number of Graphs with Rotation Systemsf multigraphs with rotation systems on a fixed number . of vertices. For .?=?1 and .?=?2 the crossing number can be computed in polynomial time and approximated to within a factor of 2 in linear time. For larger . we show how to approximate the crossing number to within a factor of . in time .(..) on a graph with . edges.作者: 含糊其辭 時(shí)間: 2025-3-31 09:14
Characterization of Unlabeled Level Planar Graphse labelings. Our contributions are twofold. First, we provide linear time drawing algorithms for . graphs. Second, we provide a complete characterization of . graphs by showing that any other graph must contain a subgraph homeomorphic to one of seven forbidden graphs.作者: reflection 時(shí)間: 2025-3-31 15:07
Moving Vertices to Make Drawings Planeow that . is NP-hard and hard to approximate. Second, we establish a connection to the graph-drawing problem ., which yields similar results for that problem. Third, we give bounds for the behavior of . on trees and general planar graphs.作者: 裙帶關(guān)系 時(shí)間: 2025-3-31 19:50 作者: 饒舌的人 時(shí)間: 2025-3-31 23:58 作者: Volatile-Oils 時(shí)間: 2025-4-1 01:52 作者: 詞匯 時(shí)間: 2025-4-1 06:27
The Evolution of Fungal Diversity,e labelings. Our contributions are twofold. First, we provide linear time drawing algorithms for . graphs. Second, we provide a complete characterization of . graphs by showing that any other graph must contain a subgraph homeomorphic to one of seven forbidden graphs.作者: HAWK 時(shí)間: 2025-4-1 11:47 作者: 共和國 時(shí)間: 2025-4-1 17:23
https://doi.org/10.1007/978-3-642-60147-7xtract multiple Kuratowski subdivisions at once. This is of particular interest for, e.g., Branch-and-Cut algorithms which require multiple such subdivisions to generate cut constraints. The algorithm is not only described theoretically, but we also present an experimental study of its implementation.作者: 表示向下 時(shí)間: 2025-4-1 20:27
Jyoti Kushwah,Vishal Singh Somvanshiw matched drawings and show that (.) two 3-connected planar graphs or a 3-connected planar graph and a tree may not be matched drawable, while (.) two trees or a planar graph and a planar graph of some special families—such as unlabeled level planar (ULP) graphs or the family of “carousel graphs”—are always matched drawable.
