2 papers
cs.DS2019
Multi-level Graph Drawing using Infomap Clustering
Seok-Hee Hong, Peter Eades, Marnijati Torkel +5
Infomap clustering finds the community structures that minimize the expected description length of a random walk trajectory; algorithms for infomap clustering run fast in practice…
cs.DB2015
Taming Subgraph Isomorphism for RDF Query Processing
Jinha Kim, Hyungyu Shin, Wook-Shin Han +2
RDF data are used to model knowledge in various areas such as life sciences, Semantic Web, bioinformatics, and social graphs. The size of real RDF data reaches billions of triples.…