K shortest path problem together with ARC tolerances

Download
009665.pdf
1990
Yılmaz, Burhan Hakan
Show full item record
122
views
0
downloads
https://hdl.handle.net/11511/6331
Graduate School of Natural and Applied Sciences, Thesis

Suggestions

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-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...
K-step betweenness centrality
Akgün, Melda Kevser; Tural, Mustafa Kemal; Department of Industrial Engineering (2019)
The notions of betweenness centrality (BC) and its extension group betweenness centrality (GBC) are widely used in social network analyses. We introduce variants of them; namely, the k-step BC and k-step GBC. The k-step GBC of a group of vertices in a network is a measure of the likelihood that at least one group member will get the information communicated between a randomly chosen pair of vertices through a randomly chosen shortest path within the first k steps of the start of the communication. The k-ste...
k-step betweenness centrality
Akgun, Melda Kevser; Tural, Mustafa Kemal (Springer Science and Business Media LLC, 2020-03-01)
The notions of betweenness centrality (BC) and group betweenness centrality (GBC) are widely used in social network analyses. We introduce variants of them; namely, the k-step BC and k-step GBC. The k-step GBC of a group of vertices in a network is a measure of the likelihood that at least one group member will get the information communicated between pairs of vertices through shortest paths within the first k steps of the start of the communication. The k-step GBC of a single vertex is the k-step BC of tha...
k-Equivalent extensions of global field k and solitary galois extensions of number fields
Shalalfeh, Mahmoud Hasan; Bilhan, Mehpare; Department of Mathematics (1998)
Citation Formats
B. H. Yılmaz, “K shortest path problem together with ARC tolerances,” Middle East Technical University, 1990.
METU IIS - Integrated Information Service open@metu.edu.tr