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 条
  • [1] On approximating tree spanners that are breadth first search trees
    Papoutsakis, Ioannis
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2016, 82 (05) : 817 - 825
  • [2] Semi-dynamic shortest paths and breadth-first search in digraphs
    Franciosa, PG
    Frigioni, D
    Giaccio, R
    STACS 97 - 14TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 1997, 1200 : 33 - 46
  • [3] AN X-Y HOMOLOGOUS PAIRING SEGMENT IN TREE SHREWS (TUPAIA)
    TODER, R
    RUMPLER, Y
    VONHOLST, D
    SCHEMPP, W
    CYTOGENETICS AND CELL GENETICS, 1993, 63 (02): : 135 - 140
  • [4] A Breadth-first Search Tree Construction for Multiplicative Circulant Graphs
    Antalan, John Rafael M.
    Campena, Francis Joseph H.
    EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS, 2021, 14 (01): : 248 - 264
  • [5] A SYNCHRONOUS ALGORITHM FOR SHORTEST PATHS ON A TREE MACHINE
    ELHORBATY, EM
    MOHAMED, AEH
    PARALLEL COMPUTING, 1992, 18 (01) : 103 - 107
  • [6] Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances
    Rozhon, Vaclav
    Haeupler, Bernhard
    Martinsson, Anders
    Grunau, Christoph
    Zuzic, Goran
    PROCEEDINGS OF THE 55TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2023, 2023, : 321 - 334
  • [7] A method of characterizing network topology based on the breadth-first search tree
    Zhou, Bin
    He, Zhe
    Wang, Nianxin
    Wang, Bing-Hong
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2016, 450 : 682 - 686
  • [8] Salembier's Min-tree algorithm turned into breadth first search
    Hesselink, WH
    INFORMATION PROCESSING LETTERS, 2003, 88 (05) : 225 - 229
  • [9] Cache-oblivious data structures and algorithms for undirected breadth-first search and shortest paths
    Brodal, GS
    Fagerberg, R
    Meyer, U
    Zeh, N
    ALGORITHM THEORY- SWAT 2004, 2004, 3111 : 480 - 492
  • [10] Clock tree tuning using shortest paths polygon
    Saaied, H
    Al-Khalili, D
    Al-Khalili, AJ
    IEEE INTERNATIONAL SOC CONFERENCE, PROCEEDINGS, 2004, : 59 - 62
12345