A new robust approach to solve minimum vertex cover problem: Malatya vertex-cover algorithm
The minimum vertex-cover problem (MVCP) is an NP-complete optimization problem widely
used in areas such as graph theory, social network, security and transportation, etc. Different …
used in areas such as graph theory, social network, security and transportation, etc. Different …
Analysis of Traffic Flow Profiles in a Transportation Network Using Graph Theory Methods
F Öztemіz - 2024 8th International Artificial Intelligence and …, 2024 - ieeexplore.ieee.org
This study aims to identify critical intersections and green wave corridors in an urban
transportation network by analyzing vehicle flows. The dataset used consists of Bluetooth …
transportation network by analyzing vehicle flows. The dataset used consists of Bluetooth …
[PDF][PDF] Topluluk Tespiti Yöntemi ile Ulaşım Ağında Verimli Yeşil Dalga Koridorlarının Belirlenmesi
Sinyalizasyon sistemleri kent içi ulaşım ağlarının yönetilmesinde önemli bir rol
oynamaktadır. Sinyalizasyon sistemlerinin optimize edilmesi ulaşım ağlarındaki trafik …
oynamaktadır. Sinyalizasyon sistemlerinin optimize edilmesi ulaşım ağlarındaki trafik …
AMFC: A New Approach Efficient Junctions Detect via Maximum Flow Approach
F Öztemiz - Bitlis Eren Üniversitesi Fen Bilimleri Dergisi, 2023 - dergipark.org.tr
In this study, max flow analysis processes are carried out with a graph theory-based
approach that can be used in optimizing the traffic load in transportation networks. The data …
approach that can be used in optimizing the traffic load in transportation networks. The data …