Efficient pattern matching on big uncertain graphs

DOI10.1016/j.ins.2015.12.034zbMath1395.68111OpenAlexW2234590865WikidataQ57942864 ScholiaQ57942864MaRDI QIDQ1671698

Lei Chen, Ye Yuan, Bo Ning, Guoren Wang

Publication date: 7 September 2018

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2015.12.034

zbMATH Keywords

uncertain datagraph data

Mathematics Subject Classification ID

Database theory (68P15) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Related Items (3)

Effective and efficient aggregation on uncertain graphs ⋮ Stable structural clustering in uncertain graphs ⋮ Limited approximate bisimulations and the corresponding rough approximations

Uses Software

• YAGO
• Fg-index
• NeMa
• Freebase
• DBpedia
• ProBase

Cites Work

• Unnamed Item
• Probabilistic SimRank computation over uncertain graphs
• On distribution function of the diameter in uncertain graph
• Efficient algorithms for the problems of enumerating cuts by non-decreasing weights
• The maximum flow problem of uncertain network
• Patterns from nature: distributed greedy colouring with simple messages and minimal graph knowledge
• Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
• Finding Maximum Clique in Stochastic Graphs Using Distributed Learning Automata
• Multi-Terminal Network Flows
• On the Number of Minimum Cuts in a Graph
• Algorithm Theory - SWAT 2004
• Probability and Computing
• Sampling

This page was built for publication: Efficient pattern matching on big uncertain graphs