Results 1 to 10 of about 894 (107)

BgNet: Classification of benign and malignant tumors with MRI multi-plane attention learning [PDF]

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, Meng-Lei Jiao, Meng-Lei Jiao, Xiao-Ying Xing, Han-Qiang Ou-Yang, Han-Qiang Ou-Yang, Han-Qiang Ou-Yang, Yuan Yuan, Jian-Fang Liu, Yuan Li, Chun-Jie Wang, Ning Lang, Yue-Liang Qian, Liang Jiang, Liang Jiang, Liang Jiang, Hui-Shu Yuan, Xiang-Dong Wang   +17 more
doaj   +2 more sources

Plane elementary bipartite graphs

Discrete Applied Mathematics, 2000
A connected graph is elementary if the union of all perfect matchings induces a connected subgraph. It is well known that a connected bipartite graph is elementary if and only if it is \(1\)-extendable, i.e., each edge is contained in a perfect matching. In this paper the authors mainly study properties of plane elementary bipartite graphs.
Heping Zhang, Fuji Zhang
exaly   +4 more sources

Forcing faces in plane bipartite graphs

Discrete Mathematics, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhongyuan Che, Zhibo Chen
exaly   +2 more sources

Existence of perfect matchings in a plane bipartite graph [PDF]

Czechoslovak Mathematical Journal, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhongyuan Che
exaly   +3 more sources

Z-transformation graphs of perfect matchings of plane bipartite graphs

Discrete Mathematics, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Heping Zhang, Fuji Zhang, Haiyuan Yao
exaly   +4 more sources

Z -transformation graphs of maximum matchings of plane bipartite graphs

Discrete Applied Mathematics, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Heping Zhang, Haiyuan Yao
exaly   +3 more sources

Forcing faces in plane bipartite graphs (II)

Discrete Applied Mathematics, 2013
AbstractThe concept of forcing faces of a plane bipartite graph was first introduced in Che and Chen (2008) [3] [Z. Che, Z. Chen, Forcing faces in plane bipartite graphs, Discrete Mathematics 308 (2008) 2427–2439], which is a natural generalization of the concept of forcing hexagons of a hexagonal system introduced in Che and Chen (2006) [2] [Z.
Zhongyuan Che, Zhibo Chen
exaly   +2 more sources

Polychromatic 4-coloring of cubic bipartite plane graphs

Discrete Mathematics, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Matthew J Katz, Atsuhiro Nakamoto
exaly   +3 more sources

Total Z-transformation graphs of perfect matching of plane bipartite graphs

Electronic Notes in Discrete Mathematics, 2000
Abstract The total Z-transformation graph and digraph of perfect matchings of a plane bipartite graph are defined. For a plane elementary bipartite graph it is shown that its total Z-transformation graph and digraph are 2-connected and strongly connected respectively.
Heping Zhang, Fuji Zhang
exaly   +2 more sources

Resonance graphs of plane bipartite graphs as daisy cubes

Discrete Applied Mathematics
We characterize plane bipartite graphs whose resonance graphs are daisy cubes, and therefore generalize related results on resonance graphs of benzenoid graphs, catacondensed even ring systems, as well as 2-connected outerplane bipartite graphs. Firstly, we prove that if $G$ is a plane elementary bipartite graph other than $K_2$, then the resonance ...
Zhongyuan Che, Niko Tratnik, Petra Žigert Pleteršek   +2 more
exaly   +4 more sources