Subgraph Matching With Effective Matching Order and Indexing
Sign Up to like & getrecommendations! Published in 2022 at "IEEE Transactions on Knowledge and Data Engineering"
DOI: 10.1109/tkde.2020.2980257
Abstract: Subgraph matching finds all embeddings from a data graph that are identical to a query graph. Recent algorithms work by generating a tree-structured index on the data graph based on the query graph, ordering the… read more here.
Keywords: index; data graph; subgraph matching; matching order ... See more keywords
Sticky Links: Encoding Quantitative Data of Graph Edges
Sign Up to like & getrecommendations! Published in 2024 at "IEEE Transactions on Visualization and Computer Graphics"
DOI: 10.1109/tvcg.2024.3388562
Abstract: Visually encoding quantitative information associated with graph links is an important problem in graph visualization. A conventional approach is to vary the thickness of lines to encode the strength of connections in node-link diagrams. In… read more here.
Keywords: sticky links; quantitative data; data graph; links encoding ... See more keywords
A Weight-Adaptive Laplacian Embedding for Graph-Based Clustering
Sign Up to like & getrecommendations! Published in 2017 at "Neural Computation"
DOI: 10.1162/neco_a_00973
Abstract: Graph-based clustering methods perform clustering on a fixed input data graph. Thus such clustering results are sensitive to the particular graph construction. If this initial construction is of low quality, the resulting clustering may also… read more here.
Keywords: graph based; adaptive laplacian; data graph; graph ... See more keywords