Results 91 to 100 of about 2,836,177 (344)
Total Face Irregularity Strength of Grid and Wheel Graph under K-Labeling of Type (1, 1, 0)
Journal of Mathematics, 2021 In this study, we used grids and wheel graphs G=V,E,F, which are simple, finite, plane, and undirected graphs with V as the vertex set, E as the edge set, and F as the face set.
Aleem Mughal, Noshad Jamil
doaj +1 more source
ENTROPY OF SOME MODELS OF SPARSE RANDOM GRAPHS WITH VERTEX-NAMES [PDF]
Probability in the Engineering and Informational Sciences, 2014 Consider the setting of sparse graphs on N vertices, where the vertices have distinct “names”, which are strings of length O(log N) from a fixed finite alphabet. For many natural probability models, the entropy grows as c N log N for some model-dependent rate constant c.
Aldous, David J, Ross, Nathan
openaire +6 more sources
A new graph invariant arises in toric topology [PDF]
, 2013 In this paper, we introduce new combinatorial invariants of any finite simple graph, which arise in toric topology. We compute the $i$-th (rational) Betti number and Euler characteristic of the real toric variety associated to a graph associahedron $P_ ...
Choi, Suyoung, Park, Hanchul
core
The structure of decomposition of a triconnected graph
, 2012 We describe the structure of triconnected graph with the help of its decomposition by 3-cutsets. We divide all 3-cutsets of a triconnected graph into rather small groups with a simple structure, named complexes.
A. V. Pastor +8 more
core +1 more source
Molecular Oncology, EarlyView.Chronic TGF‐β exposure drives epithelial HCC cells from a senescent state to a TGF‐β resistant mesenchymal phenotype. This transition is characterized by the loss of Smad3‐mediated signaling, escape from senescence, enhanced invasiveness and metastatic potential, and upregulation of key resistance modulators such as MARK1 and GRM8, ultimately promoting
Minenur Kalyoncu +11 more
wiley +1 more source
Graph Hybrid Summarization [PDF]
Journal of Artificial Intelligence and Data Mining, 2018 One solution to process and analysis of massive graphs is summarization. Generating a high quality summary is the main challenge of graph summarization.
N. Ashrafi Payaman, M.R. Kangavari
doaj +1 more source
KGNER: Improving Chinese Named Entity Recognition by BERT Infused with the Knowledge Graph
Applied Sciences, 2022 Recently, the lexicon method has been proven to be effective for named entity recognition (NER). However, most existing lexicon-based methods cannot fully utilize common-sense knowledge in the knowledge graph.
Weiwei Hu +4 more
doaj +1 more source
Nature Communications, 2021 To fully utilize the advances in omics technologies and achieve a more comprehensive understanding of human diseases, novel computational methods are required for integrative analysis of multiple types of omics data.
Tongxin Wang +6 more
semanticscholar +1 more source
IPC: A Benchmark Data Set for Learning with Graph-Structured Data [PDF]
, 2019 Benchmark data sets are an indispensable ingredient of the evaluation of graph-based machine learning methods. We release a new data set, compiled from International Planning Competitions (IPC), for benchmarking graph classification, regression, and ...
Chen, Jie +4 more
core +1 more source
clcNet: Improving the Efficiency of Convolutional Neural Network using Channel Local Convolutions
, 2018 Depthwise convolution and grouped convolution has been successfully applied to improve the efficiency of convolutional neural network (CNN). We suggest that these models can be considered as special cases of a generalized convolution operation, named ...
Zhang, Dong-Qing
core +1 more source