Results 31 to 40 of about 22,383 (289)

Computing Planarity in Computable Planar Graphs

open access: yesGraphs and Combinatorics, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Oscar Levin, Taylor McMillan
openaire   +3 more sources

New possibilities of electrocardiography: evaluation of the vectorcardiographic QRS loop planarity in patients with myocardial infarction

open access: yesЕвразийский Кардиологический Журнал, 2022
The aim of the work is to evaluate the planarity of the QRS loop and its relationship with systolic dysfunction of the left ventricle in patients in the subacute period of myocardial infarction (MI).Materials and methods.
E. V. Blinova   +9 more
doaj   +1 more source

Inverse Neutrosophic Planar Graphs and its application in optimizing the expenditure in inter-cropping [PDF]

open access: yesNeutrosophic Sets and Systems
Though Neutrosophic graphs have high impact on dealing with problems of indeterminacy, it may not directly address all aspects of edge membership degree constraints such as the truth membership degree of all edge is greater than or equal to the minimum ...
Thempaavai J.P, Antony Crispin Sweety C
doaj   +1 more source

Constrained Planarity in Practice -- Engineering the Synchronized Planarity Algorithm [PDF]

open access: yes, 2023
In the constrained planarity setting, we ask whether a graph admits a planar drawing that additionally satisfies a given set of constraints. These constraints are often derived from very natural problems; prominent examples are Level Planarity, where ...
Fink, Simon D., Rutter, Ignaz
core   +1 more source

Clustered Planarity = Flat Clustered Planarity [PDF]

open access: yes, 2018
The complexity of deciding whether a clustered graph admits a clustered planar drawing is a long-standing open problem in the graph drawing research area. Several research efforts focus on a restricted version of this problem where the hierarchy of the clusters is "flat", i.e., no cluster different from the root contains other clusters.
Pier Francesco Cortese   +1 more
openaire   +3 more sources

Planar Groups [PDF]

open access: yesJournal of Algebraic Combinatorics, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Starr, Colin L., Turner, Galen E. III
openaire   +2 more sources

Peptide Non-planarity Regained [PDF]

open access: yes
The planar peptide model has guided our understanding and interpretation of protein crystal structures since its origin in the 1950s. It is well understood that deviations from this model occur, but the majority of peptides are planar, as measured by the
Biel, Justin T.
core   +6 more sources

Recognizing IC-Planar and NIC-Planar Graphs

open access: yesJournal of Graph Algorithms and Applications, 2018
We prove that triangulated IC-planar graphs and triangulated $K_5$-free or $X4W$-free NIC-planar graphs can be recognized in cubic time. A graph is 1-planar if it can be drawn in the plane with at most one crossing per edge. A drawing is IC-planar if, in addition, each vertex is incident to at most one crossing edge and NIC-planar if two pairs of ...
Christian Bachmaier   +4 more
openaire   +7 more sources

An algorithm for an 𝓁2-homological test for the planarity of a graph

open access: yesAKCE International Journal of Graphs and Combinatorics, 2020
Given a finite simple graph Γ, one is able to define the presentation of an associate Coxeter group and construct a CW-complex on which the associated Coxeter group acts.
Elizabeth Donovan, Timothy Schroeder
doaj   +1 more source

Radial Level Planarity with Fixed Embedding

open access: yesJournal of Graph Algorithms and Applications, 2021
We study level planarity testing of graphs with a fixed combinatorial embedding for three different notions of combinatorial embeddings, namely the level embedding, the upward embedding and the planar embedding.
Guido Brückner, Ignaz Rutter
doaj   +1 more source

Home - About - Disclaimer - Privacy