Path-connection Matrices of a Simple Graph for Solving Some Path Problems

被引:0
|
作者
Gao, Zunhai [1 ]
Chen, Zhuo [2 ]
Wu, Huadi [1 ]
机构
[1] Wuhan Polytech Univ, Sch Math & Comp Sci, Wuhan, Peoples R China
[2] Wuhan Polytech Univ, Sch Econ & Management, Wuhan, Peoples R China
关键词
D O I
暂无
中图分类号
R9 [药学];
学科分类号
1007 ;
摘要
148
引用
收藏
页码:86 / 87
页数:2
相关论文
共 50 条
  • [21] The Impact of a Bi-connected Graph Decomposition on Solving Cooperative Path-finding Problems
    Surynek, Pavel
    Surynkova, Petra
    Chromy, Milos
    FUNDAMENTA INFORMATICAE, 2014, 135 (03) : 295 - 308
  • [22] On the Difficulty of Some Shortest Path Problems
    Hershberger, John
    Suri, Subhash
    Bhosle, Amit
    ACM TRANSACTIONS ON ALGORITHMS, 2007, 3 (01)
  • [23] On some path problems on oriented hypergraphs
    Nguyen, S
    Pretolani, D
    Markenzon, L
    RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1998, 32 (1-3): : 1 - 20
  • [24] On the difficulty of some shortest path problems
    Hershberger, J
    Suri, S
    Bhosle, A
    STACS 2003, PROCEEDINGS, 2003, 2607 : 343 - 354
  • [25] Solving some optimal path planning problems using an approach based on measure theory
    Borzabadi, AH
    Kamyad, AV
    Farahi, MH
    Mehne, HH
    APPLIED MATHEMATICS AND COMPUTATION, 2005, 170 (02) : 1418 - 1435
  • [26] Generalized inverse eigenvalue problem for matrices whose graph is a path
    Sen, Mausumi
    Sharma, Debashish
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2014, 446 : 224 - 236
  • [27] Mining Simple Path Traversal Patterns in Knowledge Graph
    Xiong, Feng
    Wang, Hongzhi
    JOURNAL OF WEB ENGINEERING, 2022, 21 (02): : 307 - 336
  • [28] Finding an even simple path in a directed planar graph
    Nedev, Zhivko Prodanov
    SIAM Journal on Computing, 29 (02): : 685 - 695
  • [29] PERFECT PATH DOUBLE COVERS IN EVERY SIMPLE GRAPH
    LI, H
    JOURNAL OF GRAPH THEORY, 1990, 14 (06) : 645 - 650
  • [30] Finding an even simple path in a directed planar graph
    Nedev, ZP
    SIAM JOURNAL ON COMPUTING, 1999, 29 (02) : 685 - 695