k-existentially closed groups



k-Equivalent extensions of global field k and solitary galois extensions of number fields
Shalalfeh, Mahmoud Hasan; Bilhan, Mehpare; Department of Mathematics (1998)
K-way partitioning of signed bipartite graphs
Ömeroğlu, Nurettin Burak; Toroslu, İsmail Hakkı; Department of Computer Engineering (2012)
Clustering is the process in which data is differentiated, classified according to some criteria. As a result of partitioning process, data is grouped into clusters for specific purpose. In a social network, clustering of people is one of the most popular problems. Therefore, we mainly concentrated on finding an efficient algorithm for this problem. In our study, data is made up of two types of entities (e.g., people, groups vs. political issues, religious beliefs) and distinct from most previous works, sig...
K-partitioning of Signed or Weighted Bipartite Graphs
Omeroglu, Nurettin B.; Toroslu, İsmail Hakkı; Gokalp, Sedat; Davulcu, Hasan (2013-09-14)
In this work, K-partitioning of signed or weighted bipartite graph problem has been introduced, which appears as a real life problem where the partitions of bipartite graph represent two different entities and the edges between the nodes of the partitions represent the relationships among them. A typical example is the set of people and their opinions, whose strength is represented as signed numerical values. Using the weights on the edges, these bipartite graphs can be partitioned into two or more clusters...
K shortest path problem together with ARC tolerances
Yılmaz, Burhan Hakan; Sepil, Canan; Department of Industrial Engineering (1990)
K-median clustering algorithms for time series data
Gökçem, Yiğit; İyigün, Cem; Department of Industrial Engineering (2021-3-10)
Clustering is an unsupervised learning method, that groups the unlabeled data forgathering valuable information. Clustering can be applied on various types of data. Inthis study, we have focused on time series clustering. When the studies about timeseries clustering are reviewed in the literature, for the time series data, the centers ofthe formed clusters are selected from the existing time series samples in the clusters.In this study, we have changed that view and have proposed clustering algorithmsbased...
Citation Formats
M. Kuzucuoğlu, “k-existentially closed groups,” presented at the Group Theory in Naples 2019 AGTA Workshop, (October 22-24), Naples, Italy, 2019, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/75464.