Results 51 to 60 of about 892,665 (298)
Planarity Testing and Optimal Edge Insertion with Embedding Constraints
Journal of Graph Algorithms and Applications, 2008 The planarization method has proven to be successful in graph drawing. The output, a combinatorial planar embedding of the so-called planarized graph, can be combined with state-of-the-art planar drawing algorithms.
Carsten Gutwenger +2 more
doaj +1 more source
In silico and in vitro exploration of a tyrosinase for biocatalytic production of catechols
FEBS Open Bio, EarlyView.Tyrosinase from Ralstonia pseudosolanacearum is a promising biocatalyst for producing valuable catechols from monophenol substrates. This tyrosinase is uniquely suited to this due to its high monophenolase : diphenolase ratio. We combined in silico docking and in vivo kinetic characterisation of this tyrosinase with 11 industrially relevant monophenols,
James Britton +6 more
wiley +1 more source
Planar lattices and planar graphs
Journal of Combinatorial Theory, Series B, 1976 AbstractIt is shown that a finite lattice is planar if and only if the (undirected) graph obtained from its (Hasse) diagram by adding an edge between its least and greatest elements is a planar graph.
openaire +2 more sources
Computing Planarity in Computable Planar Graphs
Graphs and Combinatorics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Oscar Levin, Taylor McMillan
openaire +3 more sources
Gravity‐Dependent Modulation of Downbeat Nystagmus: Insights From Velocity‐Storage Dysfunction
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Downbeat nystagmus varies with head position, a phenomenon termed gravity‐dependent modulation. We aimed to clarify its mechanism using a velocity‐storage model. Methods In 10 patients with downbeat nystagmus due to cerebellar disorders, we recorded eye movements at different pitch‐ and roll‐axis head positions.
Ji‐Hyung Park +5 more
wiley +1 more source
Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs
Journal of Graph Algorithms and Applications, 2014 A graph is called a strong (resp. weak) bar 1-visibility graph if its vertices can be represented as horizontal segments (bars) in the plane so that its edges are all (resp.
William Evans +4 more
doaj +1 more source
Arthritis Care &Research, Accepted Article.Introduction Systemic sclerosis (SSc) is characterized by cardiovascular risk excess not fully explained by traditional factors. Whether the severity of microvascular damage correlates with structural subclinical atherosclerosis remains unclear. We investigated the relationship between nailfold videocapillaroscopy (NVC) abnormalities and carotid ...
Eugenio Capparelli +13 more
wiley +1 more source
Multilayer Drawings of Clustered Graphs
Journal of Graph Algorithms and Applications, 2014 The cluster adjacency graph of a flat clustered graph C(G,T) is the graph A whose vertices are the clusters in T and whose edges connect clusters containing vertices that are adjacent in G.
Fabrizio Frati
doaj +1 more source
The Complexity of Drawing a Graph in a Polygonal Region
Journal of Graph Algorithms and Applications, 2022 We prove that the following problem is complete for the existential theory of the reals: Given a planar graph and a polygonal region, with some vertices of the graph assigned to points on the boundary of the region, place the remaining vertices to ...
Anna Lubiw +2 more
doaj +1 more source
On random planar graphs, the number of planar graphs and their triangulations
Journal of Combinatorial Theory, Series B, 2003 This paper investigates random planar graphs---the number of planar graphs and their triangulations. A random planar graph \(P_n\) is selected uniformly from \(\alpha_n\) where \(\alpha_n\) is the set of labelled planar graphs with \(\{1,2,3,\dots, n\}\) as vertex set. The following are the main results: (1) \(|\alpha_n|\leq n!(37.3)^{n+o(n)}\).
Deryk Osthus +2 more
openaire +2 more sources