Identifying code for directed graph

被引：0
|
作者：
Xu, Yi-Chun [1 ]
Xiao, Ren-Bin [1 ]
机构：
[1] China Three Gorges Univ, Inst Intelligent Vis & Image Informat, Yichang, Peoples R China
来源：
SNPD 2007: EIGHTH ACIS INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, ARTIFICIAL INTELLIGENCE, NETWORKING, AND PARALLEL/DISTRIBUTED COMPUTING, VOL 2, PROCEEDINGS | 2007年
基金：
中国国家自然科学基金;
关键词：
D O I：
10.1109/SNPD.2007.162
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Identifying code is a concept for undirected graph and can be applied to target identification. Its ability of identification comes from a fact that different elements in a system may have different neighbors. In this paper we extend the concept to directed graph. Then the determination rules, the concept of optimal identifying code, the formulation with integer program, and the solving steps are all extended. In this way, the identifying code problem and the alarm placement problem in earlier literatures are linked together and solved together.
引用
收藏
页码：97 / +
页数：2
相关论文
共 50 条
  • [1] On the minimum size of an identifying code over all orientations of a graph
    Cohen, Nathann
    Havet, Frederic
    ELECTRONIC JOURNAL OF COMBINATORICS, 2018, 25 (01):
  • [2] Tensor Decompositions for Identifying Directed Graph Topologies and Tracking Dynamic Networks
    Shen, Yanning
    Baingana, Brian
    Giannakis, Georgios B.
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2017, 65 (14) : 3675 - 3687
  • [3] Clustering Nodes in a Directed Acyclic Graph By Identifying Corridors of Coherent Flow
    John, John Jacob
    Beiranvand, Arash
    Cuffe, Paul
    2020 6TH IEEE INTERNATIONAL ENERGY CONFERENCE (ENERGYCON), 2020, : 604 - 609
  • [4] Identifying superword level parallelism with extended directed dependence graph reachability
    Zhao, Jie
    Zhao, Rongcai
    SCIENCE CHINA-INFORMATION SCIENCES, 2017, 60 (01)
  • [5] Identifying superword level parallelism with extended directed dependence graph reachability
    Jie ZHAO
    Rongcai ZHAO
    ScienceChina(InformationSciences), 2017, 60 (01) : 214 - 216
  • [6] BinGo: Identifying Security Patches in Binary Code with Graph Representation Learning
    He, Xu
    Wang, Shu
    Feng, Pengbin
    Wang, Xinda
    Sun, Shiyu
    Li, Qi
    Sun, Kun
    PROCEEDINGS OF THE 19TH ACM ASIA CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, ACM ASIACCS 2024, 2024, : 838 - 851
  • [7] A Directed Labeled Graph Frequent Pattern Mining Algorithm based on Minimum Code
    Li, Yuhua
    Lin, Quan
    Zhong, Gang
    Duan, Dongsheng
    Jin, Yanan
    Bi, Wei
    THIRD INTERNATIONAL CONFERENCE ON MULTIMEDIA AND UBIQUITOUS ENGINEERING (MUE 2009), 2009, : 353 - 359
  • [8] PACKING AND COVERING A GIVEN DIRECTED GRAPH IN A DIRECTED GRAPH
    Yuster, Raphael
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2024, 38 (01) : 43 - 54
  • [9] Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard
    Charon, L
    Hudry, O
    Lobstein, A
    THEORETICAL COMPUTER SCIENCE, 2003, 290 (03) : 2109 - 2120
  • [10] SIGMA: A Semantic Integrated Graph Matching Approach for identifying reused functions in binary code
    Alrabaee, Saed
    Shirani, Paria
    Wang, Lingyu
    Debbabi, Mourad
    DIGITAL INVESTIGATION, 2015, 12 : S61 - S71
12345