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 条

[31] ℓ22 Spreading Metrics for Vertex Ordering Problems
Moses Charikar
Mohammad Taghi Hajiaghayi
Howard Karloff
Satish Rao
[J]. Algorithmica, 2010, 56 : 577 - 604
[32] Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems
Xiao, Mingyu
Kou, Shaowei
[J]. THEORETICAL COMPUTER SCIENCE, 2017, 657 : 86 - 97
[33] Vertex Ordering Problems in Directed Graph Streams
Chakrabarti, Amit
Ghosh, Prantar
McGregor, Andrew
Vorotnikova, Sofya
[J]. PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 1786 - 1802
[34] Vertex Ordering Problems in Directed Graph Streams
Chakrabarti, Amit
Ghosh, Prantar
McGregor, Andrew
Vorotnikova, Sofya
[J]. PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 1786 - 1802
[35] Pathwidth of cubic graphs and exact algorithms
Fomin, FV
Hoie, K
[J]. INFORMATION PROCESSING LETTERS, 2006, 97 (05) : 191 - 196
[36] Exact Algorithms for Intervalizing Colored Graphs
Bodlaender, Hans L.
van Rooij, Johan M. M.
[J]. THEORY AND PRACTICE OF ALGORITHMS IN COMPUTER SYSTEMS, 2011, 6595 : 45 - 56
[37] A comparison of vertex ordering algorithms for large graph visualization
Mueller, Christopher
Martin, Benjamin
Lumsdaine, Andrew
[J]. ASIA-PACIFIC SYMPOSIUM ON VISUALISATION 2007, PROCEEDINGS, 2007, : 141 - +
[38] Exact Algorithms for Intervalizing Coloured Graphs
Bodlaender, Hans L.
van Rooij, Johan M. M.
[J]. THEORY OF COMPUTING SYSTEMS, 2016, 58 (02) : 273 - 286
[39] Exact Algorithms for Intervalizing Coloured Graphs
Hans L. Bodlaender
Johan M. M. van Rooij
[J]. Theory of Computing Systems, 2016, 58 : 273 - 286
[40] Improved initial vertex ordering for exact maximum clique search
Pablo San Segundo
Alvaro Lopez
Mikhail Batsyn
Alexey Nikolaev
Panos M. Pardalos
[J]. Applied Intelligence, 2016, 45 : 868 - 880

← 1 2 3 4 5 →