Results 321 to 330 of about 2,525,419 (350)
Some of the next articles are maybe not open access.
Multiplex Labeling Graph for Near-Online Tracking in Crowded Scenes
IEEE Internet of Things Journal, 2020In recent years, the demand for intelligent devices related to the Internet of Things (IoT) is rapidly increasing. In the field of computer vision, many algorithms have been preinstalled in IoT devices to achieve higher efficiency, such as face ...
Yang Zhang +5 more
semanticscholar +1 more source
Graphs and Combinatorics, 1997
A mapping \(f: E\to\{0,1\}^m\) of a graph \(G=(V,E)\) is called a mod 2 coding of \(G\), if the induced mapping \(g:V\to \{0,1\}^m\), defined by \(g(v)= \sum_{u\in V,\{u,v\}\in E}f(\{u,v\})\) assigns a different number to each vertex, where summations are taken modulo 2.
Caccetta, Louis, Jia, Rui-Zhong
openaire +2 more sources
A mapping \(f: E\to\{0,1\}^m\) of a graph \(G=(V,E)\) is called a mod 2 coding of \(G\), if the induced mapping \(g:V\to \{0,1\}^m\), defined by \(g(v)= \sum_{u\in V,\{u,v\}\in E}f(\{u,v\})\) assigns a different number to each vertex, where summations are taken modulo 2.
Caccetta, Louis, Jia, Rui-Zhong
openaire +2 more sources
SIAM Journal on Discrete Mathematics, 1992
Summary: Given a graph \(G\) and positive integer \(d\), the pair-labeling number \(r^*(G,d)\) is the minimum \(n\) such that each vertex in \(G\) can be assigned a pair of numbers from \(\{0,1,\dots,n-1\}\) so that any two numbers used at adjacent vertices differ by at least \(d\) modulo \(n\).
Guichard, David R., Krussel, John W.
openaire +1 more source
Summary: Given a graph \(G\) and positive integer \(d\), the pair-labeling number \(r^*(G,d)\) is the minimum \(n\) such that each vertex in \(G\) can be assigned a pair of numbers from \(\{0,1,\dots,n-1\}\) so that any two numbers used at adjacent vertices differ by at least \(d\) modulo \(n\).
Guichard, David R., Krussel, John W.
openaire +1 more source
Alpha Labeling of Cyclic Graphs
International Journal of Applied and Computational Mathematics, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kumar, Ajay +3 more
openaire +1 more source
On the properties of anti fuzzy graph magic labeling
THE 2ND INTERNATIONAL CONFERENCE ON SCIENCE, MATHEMATICS, ENVIRONMENT, AND EDUCATION, 2019Graph labeling is one of the famous topics in the study of fuzzy graph. This article was considering to anti fuzzy graph magic labeling. As a new concept in anti fuzzy graph, we adapted from the previous study of fuzzy graph about the related concept ...
Adika Setia Brata +4 more
semanticscholar +1 more source
On the properties of bipolar anti fuzzy graph magic labeling
THE 2ND INTERNATIONAL CONFERENCE ON SCIENCE, MATHEMATICS, ENVIRONMENT, AND EDUCATION, 2019This article was considering to bipolar anti fuzzy graph magic labeling. Bipolar anti fuzzy graph be seen as new concept, therefore to find the properties, we adapted from the previous study of bipolar fuzzy graph.
Ilman Firmansa +5 more
semanticscholar +1 more source
2018 IEEE 34th International Conference on Data Engineering (ICDE), 2018
Nowadays, a graph serves as a fundamental data structure for many applications. As graph edges stream in, users are often only interested in the recent data. In data exploration, how to store and process such massive amounts of graph stream data becomes a significant problem.
Chunyao Song, Tingjian Ge
openaire +1 more source
Nowadays, a graph serves as a fundamental data structure for many applications. As graph edges stream in, users are often only interested in the recent data. In data exploration, how to store and process such massive amounts of graph stream data becomes a significant problem.
Chunyao Song, Tingjian Ge
openaire +1 more source
Joint Graph Decomposition & Node Labeling: Problem, Algorithms, Applications
Computer Vision and Pattern Recognition, 2016We state a combinatorial optimization problem whose feasible solutions define both a decomposition and a node labeling of a given graph. This problem offers a common mathematical abstraction of seemingly unrelated computer vision tasks, including ...
Evgeny Levinkov +9 more
semanticscholar +1 more source
Antimagic Labelings of Join Graphs
Mathematics in Computer Science, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bača, Martin +3 more
openaire +1 more source
Ars combinatoria, 1999
The authors investigate such integer labelings \(w\) (called ``magic'') of edges of a graph \(G\), in which \(\sum_{v\in e}w(e)\) is a constant \(s\) independent of the vertex \(v\). They introduce basis graphs of type I and II. For the type I a unique, up to a constant factor, labeling exists with \(s>0\) and no \(0\) label.
Gobel, F., Hoede, C.
openaire +2 more sources
The authors investigate such integer labelings \(w\) (called ``magic'') of edges of a graph \(G\), in which \(\sum_{v\in e}w(e)\) is a constant \(s\) independent of the vertex \(v\). They introduce basis graphs of type I and II. For the type I a unique, up to a constant factor, labeling exists with \(s>0\) and no \(0\) label.
Gobel, F., Hoede, C.
openaire +2 more sources