Breadth First Search Tree and x-y Shortest Paths Tree

被引：0
|
作者：
Milkova, Eva [1 ]
机构：
[1] Univ Hradec Kralove, Fac Informat & Management, Rokitanskeho 62, Hradec Kralove 50003, Czech Republic
来源：
RECENT ADVANCES IN CIRCUITS, SYSTEMS AND SIGNALS | 2010年
关键词：
D O I：
暂无
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
引用
收藏
页码：15 / 15
页数：1
相关论文
共 50 条
  • [31] A tabu search algorithm for the capacitated shortest spanning tree problem
    Sharaiha, YM
    Gendreau, M
    Laporte, G
    Osman, IH
    NETWORKS, 1997, 29 (03) : 161 - 171
  • [32] First-order aspects of tree paths
    Kellerman, Ruaan
    LOGIC JOURNAL OF THE IGPL, 2015, 23 (04) : 688 - 704
  • [33] A Breadth-First Search Algorithm for Mining Generalized Frequent Itemsets Based on Set Enumeration Tree
    Mao, Yu Xing
    Shi, Bai Le
    CSA 2008: INTERNATIONAL SYMPOSIUM ON COMPUTER SCIENCE AND ITS APPLICATIONS, PROCEEDINGS, 2008, : 62 - 67
  • [34] An improved DPOP algorithm based on breadth first search pseudo-tree for distributed constraint optimization
    Chen, Ziyu
    He, Zhen
    He, Chen
    APPLIED INTELLIGENCE, 2017, 47 (03) : 607 - 623
  • [35] An improved DPOP algorithm based on breadth first search pseudo-tree for distributed constraint optimization
    Ziyu Chen
    Zhen He
    Chen He
    Applied Intelligence, 2017, 47 : 607 - 623
  • [36] GIS Geoprocessing Services Search Based on Breadth-first Reverse Share Pruning AND/OR Tree Algorithm
    Zhang, Shan
    Wang, Fengxia
    2014 10TH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION (ICNC), 2014, : 850 - 855
  • [37] PARALLEL ALGORITHM FOR DYNAMIC UPDATE OF SHORTEST PATHS TREE AFTER INSERTING AN ARC
    Nepomniaschaya, A. Sh
    Snytnikova, T., V
    PRIKLADNAYA DISKRETNAYA MATEMATIKA, 2019, (46): : 58 - 71
  • [38] Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor
    Di Salvo, A
    Proietti, G
    STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY, PROCEEDING, 2004, 3104 : 99 - 110
  • [39] Fuzzy Shortest Paths Approximation for Solving the Fuzzy Steiner Tree Problem in Graphs
    Seda, Milos
    PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY, VOL 14, 2006, 14 : 22 - 26
  • [40] Packing Strictly-Shortest Paths in a Tree for QoS-Aware Routing
    Yallouz, Jose
    Tapolcai, Janos
    Koroesi, Attila
    Berczi, Kristof
    Gyimothi, Laszlo
    Orda, Ariel
    2017 IFIP NETWORKING CONFERENCE (IFIP NETWORKING) AND WORKSHOPS, 2017,
12345