Results 21 to 30 of about 569,825 (280)
BgNet: Classification of benign and malignant tumors with MRI multi-plane attention learning
Frontiers in Oncology, 2022 ObjectivesTo propose a deep learning-based classification framework, which can carry out patient-level benign and malignant tumors classification according to the patient’s multi-plane images and clinical information.MethodsA total of 430 cases of spinal
Hong Liu +17 more
doaj +1 more source
Minimal unavoidable sets of cycles in plane graphs [PDF]
Opuscula Mathematica, 2018 A set \(S\) of cycles is minimal unavoidable in a graph family \(\cal{G}\) if each graph \(G \in \cal{G}\) contains a cycle from \(S\) and, for each proper subset \(S^{\prime}\subset S\), there exists an infinite subfamily \(\cal{G}^{\prime}\subseteq\cal{
Tomáš Madaras, Martina Tamášová
doaj +1 more source
-shaped point set embeddings of high-degree plane graphs
AKCE International Journal of Graphs and Combinatorics, 2020 A point set embedding of a given plane graph on a given point set on a plane is a drawing of where each vertex is drawn on a point in . An orthogonal point set embedding of a plane graph is a point set embedding of such that each edge is drawn as a ...
Shaheena Sultana, Md. Saidur Rahman
doaj +1 more source
The plane-width of graphs [PDF]
Journal of Graph Theory, 2011 Map vertices of a graph to (not necessarily distinct) points of the plane so that two adjacent vertices are mapped at least a unit distance apart. The plane-width of a graph is the minimum diameter of the image of the vertex set over all such mappings.
Kaminski, Marcin +2 more
openaire +3 more sources
Plane Graphs with Parity Constraints [PDF]
Graphs and Combinatorics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aichholzer Oswin +6 more
openaire +3 more sources
Polychromatic Colorings of Plane Graphs [PDF]
Discrete & Computational Geometry, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alon, N. +7 more
openaire +6 more sources
Journal of Graph Algorithms and Applications, 2008 Summary: In this paper we give a simple algorithm to generate all connected rooted plane graphs with at most m edges. A ``rooted'' plane graph is a plane graph with one designated (directed) edge on the outer face. The algorithm uses \(O(m)\) space and generates such graphs in \(O(1)\) time per graph on average without duplications.
Yamanaka, Katsuhisa, Nakano, Shin-Ichi
openaire +1 more source
Colouring of plane graphs with unique maximal colours on faces [PDF]
, 2015 The Four Colour Theorem asserts that the vertices of every plane graph can be properly coloured with four colors. Fabrici and G\"oring conjectured the following stronger statement to also hold: the vertices of every plane graph can be properly coloured ...
Wendland, Alex
core +2 more sources
Improved Bounds for Some Facially Constrained Colorings
Discussiones Mathematicae Graph Theory, 2023 A facial-parity edge-coloring of a 2-edge-connected plane graph is a facially-proper edge-coloring in which every face is incident with zero or an odd number of edges of each color. A facial-parity vertex-coloring of a 2-connected plane graph is a proper
Štorgel Kenny
doaj +1 more source
The total face irregularity strength of some plane graphs
AKCE International Journal of Graphs and Combinatorics, 2020 A face irregular total -labeling of a 2-connected plane graph is a labeling of vertices and edges such that their face-weights are pairwise distinct. The weight of a face under a labeling is the sum of the labels of all vertices and edges surrounding ...
Meilin I. Tilukay +3 more
doaj +1 more source