A Note on Exact Algorithms for Vertex Ordering Problems on Graphs

被引：0
|
作者：
Hans L. Bodlaender
Fedor V. Fomin
Arie M. C. A. Koster
Dieter Kratsch
Dimitrios M. Thilikos
机构：
[1] Utrecht University,Department of Information and Computing Sciences
[2] University of Bergen,Department of Informatics
[3] RWTH Aachen University,Lehrstuhl II für Mathematik
[4] Université de Metz,LITA
[5] National and Kapodistrian University of Athens,Department of Mathematics
来源：
Theory of Computing Systems | 2012年 / 50卷
关键词：
Graphs; Algorithms; Exponential time algorithms; Exact algorithms; Vertex ordering problems;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
In this note, we give a proof that several vertex ordering problems can be solved in O∗(2n) time and O∗(2n) space, or in O∗(4n) time and polynomial space. The algorithms generalize algorithms for the Travelling Salesman Problem by Held and Karp (J. Soc. Ind. Appl. Math. 10:196–210, 1962) and Gurevich and Shelah (SIAM J. Comput. 16:486–502, 1987). We survey a number of vertex ordering problems to which the results apply.
引用
收藏
页码：420 / 432
页数：12
相关论文
共 50 条
  • [1] A Note on Exact Algorithms for Vertex Ordering Problems on Graphs
    Bodlaender, Hans L.
    Fomin, Fedor V.
    Koster, Arie M. C. A.
    Kratsch, Dieter
    Thilikos, Dimitrios M.
    [J]. THEORY OF COMPUTING SYSTEMS, 2012, 50 (03) : 420 - 432
  • [2] Exact Algorithms for the Vertex Separator Problem in Graphs
    Cavalcante, Victor F.
    de Souza, Cid C.
    [J]. NETWORKS, 2011, 57 (03) : 212 - 230
  • [3] Vertex ordering and partitioning problems for random spatial graphs
    Penrose, MD
    [J]. ANNALS OF APPLIED PROBABILITY, 2000, 10 (02): : 517 - 538
  • [4] Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
    Guo, Jiong
    Hueffner, Falk
    Kenar, Erhan
    Niedermeier, Rolf
    Uhlmann, Johannes
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 186 (02) : 542 - 553
  • [5] Optimal vertex ordering of graphs
    Jiang, XY
    Bunke, H
    [J]. INFORMATION PROCESSING LETTERS, 1999, 72 (5-6) : 149 - 154
  • [6] Improved exact exponential algorithms for vertex bipartization and other problems
    Raman, V
    Saurabh, S
    Sikdar, S
    [J]. THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2005, 3701 : 375 - 389
  • [7] Exact and Parameterized Algorithms for Restricted Subset Feedback Vertex Set in Chordal Graphs
    Bai, Tian
    Xiao, Mingyu
    [J]. THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, TAMC 2022, 2022, 13571 : 249 - 261
  • [8] Exact algorithms for restricted subset feedback vertex set in chordal and split graphs
    Bai, Tian
    Xiao, Mingyu
    [J]. THEORETICAL COMPUTER SCIENCE, 2024, 984
  • [9] A Note on the Inducibility of -Vertex Graphs
    Even-Zohar, Chaim
    Linial, Nati
    [J]. GRAPHS AND COMBINATORICS, 2015, 31 (05) : 1367 - 1380
  • [10] Optimal algorithms for inverse vertex obnoxious center location problems on graphs
    Alizadeh, Behrooz
    Etemad, Roghayeh
    [J]. THEORETICAL COMPUTER SCIENCE, 2018, 707 : 36 - 45
12345