BFSI-B: An improved K-hop graph reachability queries for cyber-physical systems

No abstract is available for this paper.

• Publication year

  2017

• Venue

  Information Fusion

• Publication date

  2017-11-01

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1016/j.inffus.2017.02.009
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Answering Reachability Queries on Incrementally Updated Graphs by Hierarchical Labeling Schema

  2016cited by this paper
• Tree decomposition-based indexing for efficient shortest path and nearest neighbors query answering on graphs

  2016cited by this paper
• Towards social behavior in virtual-agent navigation

  2016cited by this paper
• A Tensor-Based Big Service Framework for Enhanced Living Environments

  2016cited by this paper
• Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme

  2014cited by this paper
• Reachability Queries in Very Large Graphs: A Fast Refined Online Search Approach

  2014cited by this paper
• Fast exact shortest-path distance queries on large networks by pruned landmark labeling

  2013cited by this paper
• Efficient processing of k\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k$$\end{document}-hop reachability queries

  2013cited by this paper
• K-Reach: Who is in Your Small World

  2012cited by this paper
• A highway-centric labeling approach for answering distance queries on large sparse graphs

  2012cited by this paper
• SCARAB: scaling reachability computation on large graphs

  2012cited by this paper
• Decomposing DAGs into spanning trees: A new way to compress transitive closures

  2011cited by this paper
• GRAIL: a scalable index for reachability queries in very large graphs

  2011cited by this paper
• A memory efficient reachability data structure through bit vector compression

  2011cited by this paper
• 3-HOP: a high-compression indexing scheme for reachability query

  2009cited by this paper
• Efficiently answering reachability queries on very large directed graphs

  2008cited by this paper
• An Efficient Algorithm for Answering Graph Reachability Queries

  2008cited by this paper
• Fast and practical indexing and querying of very large graphs

  2007cited by this paper
• Reachability and distance queries via 2-hop labels

  2002cited by this paper

• Efficient processing of k-hop reachability queries on temporal bipartite graphs

  2025cites this paper
• Generating <inline-formula><tex-math notation="LaTeX">$k$</tex-math><alternatives><mml:math><mml:mi>k</mml:mi></mml:math><inline-graphic xlink:href="zheng-ieq1-3532318.gif"/></alternatives><alternatives><mml:math><mml:mi>k</mml:mi></mml:math><inline-graphic xlink:href="zheng-ieq1-3532318.gif"/></alt

  2025cites this paper
• Analysis of D-Wave Topologies with k-Hop-Based Graph Metrics

  2025cites this paper
• Enabling Privacy-Preserving <inline-formula><tex-math notation="LaTeX">$K$</tex-math><alternatives><mml:math><mml:mi>K</mml:mi></mml:math><inline-graphic xlink:href="yu-ieq1-3382954.gif"/></alternatives></inline-formula>-Hop Reachability Query Over Encrypted Graphs

  2024cites this paper
• Towards Generating Hop-constrained s-t Simple Path Graphs

  2023cites this paper
• Efficient Processing of k-Hop Reachability Queries on Directed Graphs

  2023cites this paper
• An Improved Secure Public Cloud Auditing Scheme in Edge Computing

  2022cites this paper
• An ABGE-aided manufacturing knowledge graph construction approach for heterogeneous IIoT data integration

  2022cites this paper
• Efficiently Answering k-hop Reachability Queries in Large Dynamic Graphs for Fraud Feature Extraction

  2022cites this paper
• Effective task offloading heuristics for minimizing energy consumption in edge computing

  2022cites this paper
• SecVKQ: Secure and verifiable kNN queries in sensor-cloud systems

  2021cites this paper
• Secure KNN Classification Scheme Based on Homomorphic Encryption for Cyberspace

  2021cites this paper
• ESTI: Efficient k-Hop Reachability Querying over Large General Directed Graphs

  2021cites this paper
• SiegeCannon: Detecting Malicious Infrastructures by Analyzing Integral Characteristics of Involved Server Flocks

  2020cites this paper
• RFID-Based WIMEC-LANDMARC Indoor Location Algorithm

  2020cites this paper
• Data Aggregation Algorithm based on Autoregressive Model in Wireless Sensor Networks

  2020cites this paper
• Trajectory Outlier Detection Based on DBSCAN and Velocity Entropy

  2020cites this paper
• A Vulnerability Mining Model of Java Json Deserialization Based on AST

  2020cites this paper
• Importance ranking method of multiple attributes of network nodes

  2020cites this paper
• Safe Facial Multi-Attribute Feature Fusion Analysis Based on Embedded Multi-Task Learning

  2019cites this paper
• $HT$ : A Novel Labeling Scheme for k-Hop Reachability Queries on DAGs

  2019influential citation
• A Differential Privacy Random Forest Method of Privacy Protection in Cloud

  2019cites this paper
• Privacy-preserving data search with fine-grained dynamic search right management in fog-assisted Internet of Things

  2019cites this paper
• Behavior Analysis of Indoor Escape Route-Finding Based on Head-Mounted VR and Eye Tracking

  2019cites this paper
• Image Threshold Segmentation Based on GLLE Histogram

  2019cites this paper
• Cyber Physical System (CPS)-Based Industry 4.0: A Survey

  2017cites this paper