COVERING VERTICES OF A GRAPH BY VERTEX-DISJOINT PATHS

被引：13
|
作者：
NOORVASH, S [1 ]
机构：
[1] UNIV ARIZONA,TUCSON,AZ 85721
来源：
PACIFIC JOURNAL OF MATHEMATICS | 1975年 / 58卷 / 01期
关键词：
D O I：
10.2140/pjm.1975.58.159
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：159 / 168
页数：10
相关论文
共 50 条
  • [21] Dominator Tree Verification and Vertex-Disjoint Paths
    Georgiadis, Loukas
    Tarjan, Robert E.
    PROCEEDINGS OF THE SIXTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2005, : 433 - 442
  • [22] Vertex-disjoint chorded cycles in a graph
    Qiao, Shengning
    Zhang, Shenggui
    OPERATIONS RESEARCH LETTERS, 2010, 38 (06) : 564 - 566
  • [23] Reconfiguration of vertex-disjoint shortest paths on graphs
    Saito, Rin
    Eto, Hiroshi
    Ito, Takehiro
    Uehara, Ryuhei
    Journal of Graph Algorithms and Applications, 2024, 28 (03) : 87 - 101
  • [24] Finding Arc and Vertex-Disjoint Paths in Networks
    Xie, Zheng
    Chen, Zhi
    Leng, Hongze
    Zhang, Jun
    EIGHTH IEEE INTERNATIONAL CONFERENCE ON DEPENDABLE, AUTONOMIC AND SECURE COMPUTING, PROCEEDINGS, 2009, : 539 - +
  • [25] Dissemination of information in vertex-disjoint paths mode
    Hromkovic, J
    Klasing, R
    Stohr, EA
    COMPUTERS AND ARTIFICIAL INTELLIGENCE, 1996, 15 (04): : 295 - 318
  • [26] A New Algorithm for Finding Vertex-Disjoint Paths
    Kurt, Mehmet
    Berberler, Murat
    Ugurlu, Onur
    INTERNATIONAL ARAB JOURNAL OF INFORMATION TECHNOLOGY, 2015, 12 (06) : 550 - 555
  • [27] Dissemination of Information in Vertex-Disjoint Paths Mode
    Hromkovic, J.
    Klasing, R.
    Stoehr, E. A.
    Computers and Artificial Intelligence, 15 (04):
  • [28] Vertex-disjoint paths in Cayley color graphs
    Kulasinghe, P
    Bettayeb, S
    COMPUTERS AND ARTIFICIAL INTELLIGENCE, 1997, 16 (06): : 583 - 597
  • [29] Vertex-disjoint hexagons with chords in a bipartite graph
    Wang, H
    DISCRETE MATHEMATICS, 1998, 187 (1-3) : 221 - 231
  • [30] Large Vertex-Disjoint Cycles in a Bipartite Graph
    Hong Wang
    Graphs and Combinatorics, 2000, 16 : 359 - 366
12345