Matches in SemOpenAlex for { <https://semopenalex.org/work/W2963875931> ?p ?o ?g. }
Showing items 1 to 58 of
58
with 100 items per page.
- W2963875931 endingPage "288" @default.
- W2963875931 startingPage "281" @default.
- W2963875931 abstract "Reachability query is a fundamental problem which has been studied extensively due to its important role in various application domains, such as social networks, communication networks, biological networks, etc. However, few existing works pay attention to the problem of how two vertices are connected. In this paper, we investigate the problem of discovering paths of multiple resolutions connecting two vertices in large scale networks. We propose a new structure, called Muti-Resolution Path (MRP), to describe how two vertices are connected at different resolution levels. To facilitate the building of MRPs on a network of large scale, we propose a new search structure, called Hierarchical Compressed Network (HCN), which can represent a network at multiple resolution levels and can be built offline. At last, extensive experiments conducted on real-world datasets verify the effectiveness and efficiency of the proposed approach." @default.
- W2963875931 created "2019-07-30" @default.
- W2963875931 creator A5016984736 @default.
- W2963875931 creator A5036357902 @default.
- W2963875931 creator A5042507079 @default.
- W2963875931 date "2019-01-01" @default.
- W2963875931 modified "2023-09-25" @default.
- W2963875931 title "How to Reach: Discovering Multi-resolution Paths on Large Scale Networks" @default.
- W2963875931 cites W1421378112 @default.
- W2963875931 cites W1965109038 @default.
- W2963875931 cites W1994924587 @default.
- W2963875931 cites W2011282943 @default.
- W2963875931 cites W2076109400 @default.
- W2963875931 cites W2078331965 @default.
- W2963875931 cites W2088443111 @default.
- W2963875931 cites W2092251403 @default.
- W2963875931 cites W2553211886 @default.
- W2963875931 cites W328847996 @default.
- W2963875931 doi "https://doi.org/10.1007/978-3-030-26072-9_21" @default.
- W2963875931 hasPublicationYear "2019" @default.
- W2963875931 type Work @default.
- W2963875931 sameAs 2963875931 @default.
- W2963875931 citedByCount "0" @default.
- W2963875931 crossrefType "book-chapter" @default.
- W2963875931 hasAuthorship W2963875931A5016984736 @default.
- W2963875931 hasAuthorship W2963875931A5036357902 @default.
- W2963875931 hasAuthorship W2963875931A5042507079 @default.
- W2963875931 hasConcept C138268822 @default.
- W2963875931 hasConcept C154945302 @default.
- W2963875931 hasConcept C205649164 @default.
- W2963875931 hasConcept C2778755073 @default.
- W2963875931 hasConcept C41008148 @default.
- W2963875931 hasConcept C58640448 @default.
- W2963875931 hasConceptScore W2963875931C138268822 @default.
- W2963875931 hasConceptScore W2963875931C154945302 @default.
- W2963875931 hasConceptScore W2963875931C205649164 @default.
- W2963875931 hasConceptScore W2963875931C2778755073 @default.
- W2963875931 hasConceptScore W2963875931C41008148 @default.
- W2963875931 hasConceptScore W2963875931C58640448 @default.
- W2963875931 hasLocation W29638759311 @default.
- W2963875931 hasOpenAccess W2963875931 @default.
- W2963875931 hasPrimaryLocation W29638759311 @default.
- W2963875931 hasRelatedWork W2127469950 @default.
- W2963875931 hasRelatedWork W2379250586 @default.
- W2963875931 hasRelatedWork W2379753975 @default.
- W2963875931 hasRelatedWork W2386367257 @default.
- W2963875931 hasRelatedWork W2793909381 @default.
- W2963875931 hasRelatedWork W2918405586 @default.
- W2963875931 hasRelatedWork W2963031226 @default.
- W2963875931 hasRelatedWork W2966235325 @default.
- W2963875931 hasRelatedWork W4246913013 @default.
- W2963875931 hasRelatedWork W4281567723 @default.
- W2963875931 isParatext "false" @default.
- W2963875931 isRetracted "false" @default.
- W2963875931 magId "2963875931" @default.
- W2963875931 workType "book-chapter" @default.