A novel top‐ k key node query problem in subgraph matching and its greedy strategy

Search for a moving target in a competitive environment

International Journal of Game Theory ◽

10.1007/s00182-021-00761-5 ◽

2021 ◽

Author(s):

Benoit Duvocelle ◽

János Flesch ◽

Hui Min Shi ◽

Dries Vermeulen

Keyword(s):

Markov Chain ◽

Discrete Time ◽

Competitive Environment ◽

Moving Target ◽

Time Varying ◽

Greedy Strategy ◽

Time Dynamic ◽

Dynamic Search ◽

Subgame Perfect Equilibria ◽

Perfect Equilibria

AbstractWe consider a discrete-time dynamic search game in which a number of players compete to find an invisible object that is moving according to a time-varying Markov chain. We examine the subgame perfect equilibria of these games. The main result of the paper is that the set of subgame perfect equilibria is exactly the set of greedy strategy profiles, i.e. those strategy profiles in which the players always choose an action that maximizes their probability of immediately finding the object. We discuss various variations and extensions of the model.

Fault-tolerant Subgraph Matching on Aligned Networks

2020 IEEE International Conference on Big Data (Big Data) ◽

10.1109/bigdata50022.2020.9377884 ◽

2020 ◽

Author(s):

Thomas Tu ◽

Dominic Yang

Keyword(s):

Fault Tolerant ◽

Subgraph Matching

An Algorithm for Obtaining Decision Rules Based on Greedy Strategy in Consistent Decision Information System

2010 2nd International Conference on Information Engineering and Computer Science ◽

10.1109/iciecs.2010.5678422 ◽

2010 ◽

Author(s):

Guojun Zhang ◽

Jixiong Chen

Keyword(s):

Information System ◽

Decision Rules ◽

Greedy Strategy

3-D Object Recognition Based on Subgraph Matching in Polynomial Time

Structural Pattern Analysis ◽

10.1142/9789814368292_0008 ◽

1990 ◽

pp. 131-147 ◽

Cited By ~ 5

Author(s):

E. Gmür ◽

H. Bunke

Keyword(s):

Object Recognition ◽

Polynomial Time ◽

Subgraph Matching

FAST: FPGA-based Subgraph Matching on Massive Graphs

2021 IEEE 37th International Conference on Data Engineering (ICDE) ◽

10.1109/icde51399.2021.00129 ◽

2021 ◽

Author(s):

Xin Jin ◽

Zhengyi Yang ◽

Xuemin Lin ◽

Shiyu Yang ◽

Lu Qin ◽

...

Keyword(s):

Subgraph Matching ◽

Massive Graphs

Relay Selection Algorithm Based on Social Network Combined with Greedy Strategy for Vehicle D2D Communication

Hans Journal of Wireless Communications ◽

10.12677/hjwc.2021.113009 ◽

2021 ◽

Vol 11 (03) ◽

pp. 76-86

Author(s):

泓崭冯

Keyword(s):

Social Network ◽

Relay Selection ◽

D2d Communication ◽

Selection Algorithm ◽

Greedy Strategy ◽

Relay Selection Algorithm

Web Service Matchmaking by Subgraph Matching

Lecture Notes in Business Information Processing - Web Information Systems and Technologies ◽

10.1007/978-3-642-28082-5_4 ◽

2012 ◽

pp. 43-56 ◽

Cited By ~ 4

Author(s):

Hamida Seba ◽

Sofiane Lagraa ◽

Hamamache Kheddouci

Keyword(s):

Web Service ◽

Subgraph Matching

Application of Density Clustering Algorithm Based on Greedy Strategy in Hot Spot Mining of Taxi Passengers

Transactions on Edutainment XVI - Lecture Notes in Computer Science ◽

10.1007/978-3-662-61510-2_10 ◽

2020 ◽

pp. 105-113

Author(s):

Yiping Bao ◽

Jianglin Luo ◽

Qingqing Wang

Keyword(s):

Clustering Algorithm ◽

Hot Spot ◽

Greedy Strategy ◽

Density Clustering

BR-Index: An Indexing Structure for Subgraph Matching in Very Large Dynamic Graphs

Lecture Notes in Computer Science - Scientific and Statistical Database Management ◽

10.1007/978-3-642-22351-8_20 ◽

2011 ◽

pp. 322-331 ◽

Cited By ~ 2

Author(s):

Jiong Yang ◽

Wei Jin

Keyword(s):

Dynamic Graphs ◽

Subgraph Matching ◽

Indexing Structure

Constructive Induction Using a Non-Greedy Strategy for Feature Selection

Machine Learning Proceedings 1992 ◽

10.1016/b978-1-55860-247-2.50050-4 ◽

1992 ◽

pp. 355-360 ◽

Cited By ~ 8

Author(s):

Arlindo L. Oliveira ◽

Alberto Sangiovanni-Vincentelli

Keyword(s):

Feature Selection ◽

Constructive Induction ◽

Greedy Strategy