Document Open Access Logo

An Exact Algorithm for Knot-Free Vertex Deletion

Authors M. S. Ramanujan, Abhishek Sahu, Saket Saurabh, Shaily Verma

PDF
Thumbnail PDF

File

LIPIcs.MFCS.2022.78.pdf
  • Filesize: 0.8 MB
  • 15 pages

Document Identifiers

Author Details

M. S. Ramanujan
  • Department of Computer Science, University of Warwick, UK
Abhishek Sahu
  • Institute of Mathematical Sciences, Chennai, India
Saket Saurabh
  • Institute of Mathematical Sciences, Chennai, India
  • University of Bergen, Norway
Shaily Verma
  • Institute of Mathematical Sciences, Chennai, India

Funding

  • Ramanujan, M. S.: Supported by Engineering and Physical Sciences Research Council (EPSRC) grants EP/V007793/1 and EP/V044621/1.
  • Saurabh, Saket: Supported by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No.~819416); and he also acknowledges the support of Swarnajayanti Fellowship grant DST/SJF/MSA-01/2017-18.

Cite AsGet BibTex

M. S. Ramanujan, Abhishek Sahu, Saket Saurabh, and Shaily Verma. An Exact Algorithm for Knot-Free Vertex Deletion. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 78:1-78:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
https://doi.org/10.4230/LIPIcs.MFCS.2022.78

Abstract

The study of the Knot-Free Vertex Deletion problem emerges from its application in the resolution of deadlocks called knots, detected in a classical distributed computation model, that is, the OR-model. A strongly connected subgraph Q of a digraph D with at least two vertices is said to be a knot if there is no arc (u,v) of D with u ∈ V(Q) and v ∉ V(Q) (no-out neighbors of the vertices in Q). Given a directed graph D, the Knot-Free Vertex Deletion (KFVD) problem asks to compute a minimum-size subset S ⊂ V(D) such that D[V⧵S] contains no knots. There is no exact algorithm known for the KFVD problem in the literature that is faster than the trivial O^⋆(2ⁿ) brute-force algorithm. In this paper, we obtain the first non-trivial upper bound for KFVD by designing an exact algorithm running in time 𝒪^⋆(1.576ⁿ), where n is the size of the vertex set in D.

Subject Classification

ACM Subject Classification
  • Theory of computation → Fixed parameter tractability
Keywords
  • exact algorithm
  • knot-free graphs
  • branching algorithm

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. Valmir Carneiro Barbosa, Alan Diêgo A. Carneiro, Fábio Protti, and Uéverton S. Souza. Deadlock models in distributed computation: foundations, design, and computational complexity. In Sascha Ossowski, editor, Proceedings of the 31st Annual ACM Symposium on Applied Computing, Pisa, Italy, April 4-8, 2016, pages 538-541. ACM, 2016. URL: https://doi.org/10.1145/2851613.2851880.
  2. Stéphane Bessy, Marin Bougeret, Alan Diêgo A. Carneiro, Fábio Protti, and Uéverton S. Souza. Width parameterizations for knot-free vertex deletion on digraphs. In Bart M. P. Jansen and Jan Arne Telle, editors, 14th International Symposium on Parameterized and Exact Computation, IPEC 2019, September 11-13, 2019, Munich, Germany, volume 148 of LIPIcs, pages 2:1-2:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. URL: https://doi.org/10.4230/LIPIcs.IPEC.2019.2.
  3. Andreas Björklund. Determinant sums for hamiltonicity (invited talk). In Jiong Guo and Danny Hermelin, editors, 11th International Symposium on Parameterized and Exact Computation, IPEC 2016, August 24-26, 2016, Aarhus, Denmark, volume 63 of LIPIcs, pages 1:1-1:1. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. URL: https://doi.org/10.4230/LIPIcs.IPEC.2016.1.
  4. Alan Diêgo Aurélio Carneiro, Fábio Protti, and Uéverton dos Santos Souza. On knot-free vertex deletion: Fine-grained parameterized complexity analysis of a deadlock resolution graph problem. Theoretical Computer Science, 909:97-109, 2022. Google Scholar
  5. Alan Diêgo Aurélio Carneiro, Fábio Protti, and Uéverton S. Souza. Deletion graph problems based on deadlock resolution. In Yixin Cao and Jianer Chen, editors, Computing and Combinatorics - 23rd International Conference, COCOON 2017, Hong Kong, China, August 3-5, 2017, Proceedings, volume 10392 of Lecture Notes in Computer Science, pages 75-86. Springer, 2017. URL: https://doi.org/10.1007/978-3-319-62389-4_7.
  6. Alan Diêgo Aurélio Carneiro, Fábio Protti, and Uéverton S. Souza. Deadlock resolution in wait-for graphs by vertex/arc deletion. J. Comb. Optim., 37(2):546-562, 2019. URL: https://doi.org/10.1007/s10878-018-0279-5.
  7. Jianer Chen, Yang Liu, Songjian Lu, Barry O'Sullivan, and Igor Razgon. A fixed-parameter algorithm for the directed feedback vertex set problem. J. ACM, 55(5):21:1-21:19, 2008. URL: https://doi.org/10.1145/1411509.1411511.
  8. Reinhard Diestel. Graph Theory, 4th Edition, volume 173 of Graduate texts in mathematics. Springer, 2012. Google Scholar
  9. Fedor V. Fomin, Serge Gaspers, Daniel Lokshtanov, and Saket Saurabh. Exact algorithms via monotone local search. In Daniel Wichs and Yishay Mansour, editors, Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18-21, 2016, pages 764-775. ACM, 2016. URL: https://doi.org/10.1145/2897518.2897551.
  10. Fedor V. Fomin, Dieter Kratsch, and Gerhard J. Woeginger. Exact (exponential) algorithms for the dominating set problem. In Proceedings of the 30th International Conference on Graph-Theoretic Concepts in Computer Science, WG'04, pages 245-256, Berlin, Heidelberg, 2004. Springer-Verlag. URL: https://doi.org/10.1007/978-3-540-30559-0_21.
  11. F.V. Fomin and D. Kratsch. Exact Exponential Algorithms. Texts in Theoretical Computer Science. An EATCS Series. Springer Berlin Heidelberg, 2010. URL: https://books.google.co.in/books?id=LXDe1XHJCYIC.
  12. Gordon Hoi. An improved exact algorithm for the exact satisfiability problem. CoRR, abs/2010.03850, 2020. URL: http://arxiv.org/abs/2010.03850.
  13. Kamal Jain, Mohammad Taghi Hajiaghayi, and Kunal Talwar. The generalized deadlock resolution problem. In Luís Caires, Giuseppe F. Italiano, Luís Monteiro, Catuscia Palamidessi, and Moti Yung, editors, Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings, volume 3580 of Lecture Notes in Computer Science, pages 853-865. Springer, 2005. URL: https://doi.org/10.1007/11523468_69.
  14. Carlos VGC Lima, Fábio Protti, Dieter Rautenbach, Uéverton S Souza, and Jayme L Szwarcfiter. And/or-convexity: a graph convexity based on processes and deadlock models. Annals of Operations Research, 264(1):267-286, 2018. Google Scholar
  15. Daniel Lokshtanov, M. S. Ramanujan, and Saket Saurabh. When recursion is better than iteration: A linear-time algorithm for acyclicity with few error vertices. In Artur Czumaj, editor, Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018, pages 1916-1933. SIAM, 2018. URL: https://doi.org/10.1137/1.9781611975031.125.
  16. Alane Marie de Lima and Renato Carmo. Exact algorithms for the graph coloring problem. Revista de Informática Teórica e Aplicada, 25:57, November 2018. URL: https://doi.org/10.22456/2175-2745.80721.
  17. Fabiano de S Oliveira and Valmir C Barbosa. Revisiting deadlock prevention: A probabilistic approach. Networks, 63(2):203-210, 2014. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact