Results 31 to 40 of about 636,087 (268)
The Role of Visual Scaffolding in Enhancing Iranian EFL Students’ Writing Ability [PDF]
Issues in Language Teaching, 2019 To better illuminate the link between scaffolding and visual aids, this quasi-experimental study attempted to scaffold an intact group of 14 intermediate-level Iranian English as a foreign language (EFL) learners through providing graphs with the aim of ...
Mahnaz Mostafaei Alaei +2 more
doaj +1 more source
Journal of Graph Algorithms and Applications, 2005 Summary: The task of drawing subgraphs is often underestimated and they are simply emphasized using different colors or line styles. In this paper, we present an approach for drawing graphs within graphs that first produces a layout for the subgraphs thus increasing their locality.
Paul Holleis +2 more
openaire +1 more source
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
Biclique Graphs of K3-free Graphs and Bipartite Graphs
Procedia Computer Science, 2021 A biclique of a graph is a maximal complete bipartite subgraph. The biclique graph of a graph $G$, $KB(G)$, defined as the intersection graph of the bicliques of $G$, was introduced and characterized in 2010. However, this characterization does not lead to polynomial time recognition algorithms.
Marina Groshaus +1 more
openaire +2 more sources
Annals of Pure and Applied Logic, 2017 In two previous papers, we exposed a combinatorial approach to the program of Geometry of Interaction, a program initiated by Jean-Yves Girard. The strength of our approach lies in the fact that we interpret proofs by simpler structures - graphs - than Girard's constructions, while generalizing the latter since they can be recovered as special cases of
openaire +4 more sources
Graphs whose line graphs are ring graphs [PDF]
AKCE International Journal of Graphs and Combinatorics, 2020 Given a graph H, a path of length at least two is called an H-path if meets H exactly in its ends. A graph G is a ring graph if each block of G which is not a bridge or a vertex can be constructed inductively by starting from a single cycle and then in each step adding an H-path that meets graph H in the previous step in two adjacent vertices.
openaire +2 more sources
Packing Smaller Graphs into a Graph
Discrete Mathematics, 1989 Let G be a connected graph and \(\alpha_ m(G)\) denote the largest number of vertex-disjoint connected subgraphs \(H_ 1,H_ 2,...,H_ k\) of G each having m vertices. The authors obtain the following bounds for the m-packing number \(\alpha_ m(G)\) for a connected graph G of order n and maximum degree \(\Delta\). \[ \lceil \frac{n-m+1}{(m-1)(\Delta -1)+1}
Jin Akiyama +2 more
openaire +2 more sources
IEEE AccessFinancial transaction networks represent inter-firm relationships, where firms and transactions act as nodes and edges, respectively. Link prediction in these networks aims to identify potential future or missing transactions or links, providing valuable
Aparajita Bose, Byunghoon Kim
doaj +1 more source
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
Graph Passing in Graph Transformation.
Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2012 Graph transformation works under the whole world assumption. Therefore, in realistic systems, both the individual graphs and the set of all such graphs can grow very large. In reactive formalisms such as process algebra, on the other hand, each system is split into smaller components which continually interact; the interactions pass information such as
Ghamarian, A.H., Rensink, Arend
openaire +3 more sources