Search for C-Optimal Routes in Graphs

被引:0
作者
Bugaev, Yu. V. [1 ]
Chikunov, S. V. [1 ]
Muzalevskii, F. A. [1 ]
机构
[1] Voronezh State Univ Engn Technol, Voronezh, Russia
关键词
graph; choice function; binary relation; dynamic programming;
D O I
10.1134/S0005117917110091
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We propose search algorithms for paths in graphs that are optimal in the sense of a given choice function. As an example we consider the choice mechanism with respect to a binary relation that does not contain numerical criterial estimates.
引用
收藏
页码:2039 / 2050
页数:12
相关论文
共 50 条
  • [31] Top-Down Construction of Locally Monotonic Graphs for Similarity Search
    Foster, Cole
    Chavez, Edgar
    Kimia, Benjamin
    SIMILARITY SEARCH AND APPLICATIONS, SISAP 2024, 2025, 15268 : 291 - 300
  • [32] Search for the end of a path in the d-dimensional grid and in other graphs
    Gerbner, Daniel
    Keszegh, Balazs
    Palvolgyi, Domotor
    Rote, Guenter
    Wiener, Gabor
    ARS MATHEMATICA CONTEMPORANEA, 2017, 12 (02) : 301 - 314
  • [33] An enhanced bitstring encoding for exact maximum clique search in sparse graphs
    San Segundo, Pablo
    Artieda, Jorge
    Batsyn, Mikhail
    Pardalos, Panos M.
    OPTIMIZATION METHODS & SOFTWARE, 2017, 32 (02) : 312 - 335
  • [34] An optimal investivation in two stage search with recognition errors
    Komiya, Toru
    Iida, Koji
    Hohzaki, Ryusuke
    JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 2006, 49 (02) : 130 - 143
  • [35] Optimal Multi-Meeting-Point Route Search
    Li, Rong-Hua
    Qin, Lu
    Yu, Jeffrey Xu
    Mao, Rui
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2016, 28 (03) : 770 - 784
  • [36] M optimal routes hops strategy: detecting sinkhole attacks in wireless sensor networks
    Zhaohui Zhang
    Sanyang Liu
    Yiguang Bai
    Yalin Zheng
    Cluster Computing, 2019, 22 : 7677 - 7685
  • [37] M optimal routes hops strategy: detecting sinkhole attacks in wireless sensor networks
    Zhang, Zhaohui
    Liu, Sanyang
    Bai, Yiguang
    Zheng, Yalin
    CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2019, 22 (Suppl 3): : S7677 - S7685
  • [38] Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time
    Didimo, Walter
    Liotta, Giuseppe
    Ortali, Giacomo
    Patrignani, Maurizio
    PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 806 - 825
  • [39] Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time
    Didimo, Walter
    Liotta, Giuseppe
    Ortali, Giacomo
    Patrignani, Maurizio
    PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 806 - 825
  • [40] Matrix Method to Search k-Maximum Internally Stable Sets of Graphs
    Yue Jumei
    Yan Yongyi
    2015 34TH CHINESE CONTROL CONFERENCE (CCC), 2015, : 36 - 41