Graph based approach to the minimum hub problem in transportation network
Saved in:
| Main Authors: | Jan Owsiński, Jarosław Stańczak, Aleksy Barski, Krzysztof Sęp, Piotr Sapiecha |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Polish Information Processing Society
2015-10-01
|
| Series: | Annals of computer science and information systems |
| Online Access: | https://annals-csis.org/Volume_5/pliks/218.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Evolutionary k-means Graph Clustering Method to Obtain the hub&spoke Structure for Warsaw Communication System
by: Jarosław Stańczak, et al.
Published: (2023-10-01) -
Minimum Neighborhood Domination of Split Graph of Graphs
by: ANJALINE. W, et al.
Published: (2023-03-01) -
A Developmental Genetic Approach to the cost/time trade-off in Resource Constrained Project Scheduling
by: Grzegorz Pawiński, et al.
Published: (2014-09-01) -
On the Hub Number of Ring Graphs and Their Behavior Under Graph Operations
by: Mohammed Alsharafi, et al.
Published: (2025-01-01) -
Identifying Hubs Through Influential Nodes in Transportation Network by Using a Gravity Centrality Approach
by: Worawit Tepsan, et al.
Published: (2025-06-01)