Matches in SemOpenAlex for { <https://semopenalex.org/work/W2911713446> ?p ?o ?g. }
Showing items 1 to 86 of
86
with 100 items per page.
- W2911713446 abstract "The problem of computing distances and shortest paths between vertices in graphs is one of the fundamental issues in graph theory. It is of great importance in many different applications, for example, transportation, and social network analysis. However, efficient shortest distance algorithms are still desired in many disciplines. Basically, the majority of dense graphs have ties between the shortest distances. Therefore, we consider a different approach and introduce a new measure to solve all-pairs shortest paths for undirected and unweighted graphs. This measures the shortest distance between any two vertices by considering the length and the number of all possible paths between them. The main aim of this new approach is to break the ties between equal shortest paths SP, which can be obtained by the Breadth-first search algorithm (BFS), and distinguish meaningfully between these equal distances. Moreover, using the new measure in clustering produces higher quality results compared with SP. In our study, we apply two different clustering techniques: hierarchical clustering and K-means clustering, with four different graph models, and for a various number of clusters. We compare the results using a modularity function to check the quality of our clustering results." @default.
- W2911713446 created "2019-02-21" @default.
- W2911713446 creator A5019253093 @default.
- W2911713446 creator A5034101729 @default.
- W2911713446 creator A5071909143 @default.
- W2911713446 date "2019-01-01" @default.
- W2911713446 modified "2023-09-23" @default.
- W2911713446 title "A New Approach to Measuring Distances in Dense Graphs" @default.
- W2911713446 cites W2008427435 @default.
- W2911713446 cites W2011430131 @default.
- W2911713446 cites W2047940964 @default.
- W2911713446 cites W2127048411 @default.
- W2911713446 cites W2131681506 @default.
- W2911713446 cites W2151021662 @default.
- W2911713446 cites W2151936673 @default.
- W2911713446 cites W2468306032 @default.
- W2911713446 cites W2479531384 @default.
- W2911713446 cites W2726539084 @default.
- W2911713446 doi "https://doi.org/10.1007/978-3-030-13709-0_17" @default.
- W2911713446 hasPublicationYear "2019" @default.
- W2911713446 type Work @default.
- W2911713446 sameAs 2911713446 @default.
- W2911713446 citedByCount "0" @default.
- W2911713446 crossrefType "book-chapter" @default.
- W2911713446 hasAuthorship W2911713446A5019253093 @default.
- W2911713446 hasAuthorship W2911713446A5034101729 @default.
- W2911713446 hasAuthorship W2911713446A5071909143 @default.
- W2911713446 hasBestOaLocation W29117134462 @default.
- W2911713446 hasConcept C11413529 @default.
- W2911713446 hasConcept C124101348 @default.
- W2911713446 hasConcept C132525143 @default.
- W2911713446 hasConcept C154945302 @default.
- W2911713446 hasConcept C186065694 @default.
- W2911713446 hasConcept C22047676 @default.
- W2911713446 hasConcept C22590252 @default.
- W2911713446 hasConcept C2780009758 @default.
- W2911713446 hasConcept C3018234147 @default.
- W2911713446 hasConcept C41008148 @default.
- W2911713446 hasConcept C54385418 @default.
- W2911713446 hasConcept C70266271 @default.
- W2911713446 hasConcept C73555534 @default.
- W2911713446 hasConcept C80444323 @default.
- W2911713446 hasConcept C92835128 @default.
- W2911713446 hasConceptScore W2911713446C11413529 @default.
- W2911713446 hasConceptScore W2911713446C124101348 @default.
- W2911713446 hasConceptScore W2911713446C132525143 @default.
- W2911713446 hasConceptScore W2911713446C154945302 @default.
- W2911713446 hasConceptScore W2911713446C186065694 @default.
- W2911713446 hasConceptScore W2911713446C22047676 @default.
- W2911713446 hasConceptScore W2911713446C22590252 @default.
- W2911713446 hasConceptScore W2911713446C2780009758 @default.
- W2911713446 hasConceptScore W2911713446C3018234147 @default.
- W2911713446 hasConceptScore W2911713446C41008148 @default.
- W2911713446 hasConceptScore W2911713446C54385418 @default.
- W2911713446 hasConceptScore W2911713446C70266271 @default.
- W2911713446 hasConceptScore W2911713446C73555534 @default.
- W2911713446 hasConceptScore W2911713446C80444323 @default.
- W2911713446 hasConceptScore W2911713446C92835128 @default.
- W2911713446 hasLocation W29117134461 @default.
- W2911713446 hasLocation W29117134462 @default.
- W2911713446 hasOpenAccess W2911713446 @default.
- W2911713446 hasPrimaryLocation W29117134461 @default.
- W2911713446 hasRelatedWork W1508887260 @default.
- W2911713446 hasRelatedWork W1996134775 @default.
- W2911713446 hasRelatedWork W2056439736 @default.
- W2911713446 hasRelatedWork W2077382842 @default.
- W2911713446 hasRelatedWork W2095244040 @default.
- W2911713446 hasRelatedWork W2116477200 @default.
- W2911713446 hasRelatedWork W2126979209 @default.
- W2911713446 hasRelatedWork W2395693708 @default.
- W2911713446 hasRelatedWork W2560576693 @default.
- W2911713446 hasRelatedWork W2573735949 @default.
- W2911713446 hasRelatedWork W2765125282 @default.
- W2911713446 hasRelatedWork W2773259269 @default.
- W2911713446 hasRelatedWork W2884391694 @default.
- W2911713446 hasRelatedWork W2975614804 @default.
- W2911713446 hasRelatedWork W2999205404 @default.
- W2911713446 hasRelatedWork W3034876319 @default.
- W2911713446 hasRelatedWork W3051020105 @default.
- W2911713446 hasRelatedWork W3125347116 @default.
- W2911713446 hasRelatedWork W47316739 @default.
- W2911713446 hasRelatedWork W2158827914 @default.
- W2911713446 isParatext "false" @default.
- W2911713446 isRetracted "false" @default.
- W2911713446 magId "2911713446" @default.
- W2911713446 workType "book-chapter" @default.