Results 31 to 40 of about 2,686,069 (331)
On grounded L-graphs and their relatives [PDF]
, 2018 We consider the graph class Grounded-L corresponding to graphs that admit an intersection representation by L-shaped curves, where additionally the topmost points of each curve are assumed to belong to a common horizontal line.
Jelínek, Vít, Töpfer, Martin
core +3 more sources
Graphs Cospectral with Kneser Graphs [PDF]
SSRN Electronic Journal, 2009 AMS Subject Classification ...
Haemers, W.H., Ramezani, F.
openaire +5 more sources
Classifying image analysis techniques from their output
International Journal of Computational Intelligence Systems, 2016 In this paper we discuss some main image processing techniques in order to propose a classification based upon the output these methods provide. Because despite a particular image analysis technique can be supervised or unsupervised, and can allow or not
C Guada +4 more
doaj +1 more source
International Journal of Foundations of Computer Science, 2008 Switching graphs are graphs that contain switches. A switch is a pair of edges that start in the same vertex and of which precisely one edge is enabled at any time. By using a Boolean function called a switch setting, the switches in a switching graph can be put in a fixed direction to obtain an ordinary graph.
Groote, J.F., Ploeger, B.
openaire +4 more sources
Anomaly Detection in Graphs of Bank Transactions for Anti Money Laundering Applications
IEEE Access, 2022 Our aim in this paper is to detect bank clients involved in suspicious activities related to money laundering, using the graph of transactions of the bank.
Bogdan Dumitrescu +2 more
doaj +1 more source
Forum of Mathematics, Sigma, 2019 An elastic graph is a graph with an elasticity associated to each edge. It may be viewed as a network made out of ideal rubber bands. If the rubber bands are stretched on a target space there is an elastic energy. We characterize when a homotopy class of maps from one elastic graph to another is loosening, that is, decreases this elastic energy for all
openaire +3 more sources
Proceedings of the ACM Multimedia 2017 Workshop on South African Academic Participation, 2017 We present a means of formulating and solving graph coloring problems with probabilistic graphical models. In contrast to the prevalent literature that uses factor graphs for this purpose, we instead approach it from a cluster graph perspective. Since there seems to be a lack of algorithms to automatically construct valid cluster graphs, we provide ...
Streicher, Simon, Preez, Johan du
openaire +2 more sources
Graph Filtering Over Expanding Graphs
2022 IEEE Data Science and Learning Workshop (DSLW), 2022 Our capacity to learn representations from data is related to our ability to design filters that can leverage their coupling with the underlying domain. Graph filters are one such tool for network data and have been used in a myriad of applications.
Das, Bishwadeep, Isufi, Elvin
openaire +2 more sources
Concepts and Practice of Statistics: Part 3 - Graphics
Australasian Orthodontic Journal, 1987 The process of analysis of a set data aims to detect patterns, especially relationships between variables, in the data. Statistical techniques can be described broadly as techniques to detect particular types of patterns, and to test whether such ...
McLean Alan L.
doaj +1 more source
Embedding Graphs into Colored Graphs [PDF]
Transactions of the American Mathematical Society, 1988 If X X is a graph, κ \kappa a cardinal, then there is a graph Y Y such that if the vertex set of Y Y is κ \kappa -colored, then there exists a monocolored induced copy of X X ; moreover, if X X does not contain a complete graph on
Hajnal, András, Komjáth, P.
openaire +1 more source