Document Open Access Logo

Editing to Connected f-Degree Graph

Authors Fedor V. Fomin, Petr Golovach, Fahad Panolan, Saket Saurabh

PDF

File

Thumbnail PDF
PDF
LIPIcs.STACS.2016.36.pdf
  • Filesize: 0.68 MB
  • 14 pages

Document Identifiers

Subject Classification

Keywords
  • Connected f-factor
  • FPT
  • Representative Family
  • Color Coding

Metrics

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

Abstract

In the EDGE EDITING TO CONNECTED f-DEGREE GRAPH problem we are given a graph G, an integer k and a function f assigning integers to vertices of G. The task is to decide whether there is a connected graph F on the same vertex set as G, such that for every vertex v, its degree in F is f(v) and the number of edges inthe symmetric difference of E(G) and E(F), is at most k. We show that EDGE EDITING TO CONNECTED f-DEGREE GRAPH is fixed-parameter tractable (FPT) by providing an algorithm solving the problem on an n-vertex graph in time 2^{O(k)}n^{O(1)}. Our FPT algorithm is based on a non-trivial combination of color-coding and fast computations of representative families over direct sum matroid of l-elongation of co-graphic matroid associated with G and uniform matroid over the set of non-edges of G. We believe that this combination could be useful in designing parameterized algorithms for other edge editing problems.

Cite As Get BibTex

Fedor V. Fomin, Petr Golovach, Fahad Panolan, and Saket Saurabh. Editing to Connected f-Degree Graph. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 36:1-36:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016) https://doi.org/10.4230/LIPIcs.STACS.2016.36

Author Details

Fedor V. Fomin
Petr Golovach
Fahad Panolan
Saket Saurabh

References

  1. Jin Akiyama and Mikio Kano. Factors and factorizations of graphs - a survey. Journal of Graph Theory, 9(1):1-42, 1985. Google Scholar
  2. Noga Alon, Daniel Lokshtanov, and Saket Saurabh. Fast FAST. In Proceedings of the 36th International Colloquium of Automata, Languages and Programming (ICALP), volume 5555 of Lecture Notes in Comput. Sci., pages 49-58. Springer, 2009. Google Scholar
  3. R. P. Anstee. An algorithmic proof of Tutte’s f-factor theorem. J. Algorithms, 6(1):112-131, 1985. Google Scholar
  4. Rajesh Hemant Chitnis, Marek Cygan, MohammadTaghi Hajiaghayi, Marcin Pilipczuk, and Michal Pilipczuk. Designing FPT algorithms for cut problems using randomized contractions. In Proceedings of the 53rd Annual Symposium on Foundations of Computer Science (FOCS), pages 460-469, 2012. Google Scholar
  5. Reinhard Diestel. Graph theory, volume 173 of Graduate Texts in Mathematics. Springer-Verlag, Berlin, 3rd edition, 2005. Google Scholar
  6. Herbert Fleischner. Eulerian Graphs and Related Topics, Part 1, Volume 1. Annals of Discrete Mathematics 45. Elsevier, Amsterdam, 1990. Google Scholar
  7. Fedor V. Fomin and Yngve Villanger. Subexponential parameterized algorithm for minimum fill-in. SIAM J. Computing, 42(6):2197-2216, 2013. Google Scholar
  8. Petr A. Golovach. Editing to a connected graph of given degrees. In Proceedings of the 39th International Symposium on Mathematical Foundations of Computer Science (MFCS), volume 8635 of Lecture Notes in Comput. Sci., pages 324-335. Springer, 2014. Google Scholar
  9. Ken-ichi Kawarabayashi and Mikkel Thorup. The minimum k-way cut of bounded size is fixed-parameter tractable. In Proceedings of the 52nd Annual Symposium on Foundations of Computer Science (FOCS), pages 160-169. IEEE, 2011. Google Scholar
  10. T Kirkman. On a problem in combinatorics. Cambridge and Dublin Math. J ., 2:191-204, 1847. Google Scholar
  11. Mekkia Kouider and Preben D. Vestergaard. Connected factors in graphs - a survey. Graphs and Combinatorics, 21(1):1-26, 2005. Google Scholar
  12. Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, and Saket Saurabh. Deterministic truncation of linear matroids. In Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I, volume 9134 of Lecture Notes in Computer Science, pages 922-934. Springer, 2015. Google Scholar
  13. László Lovász and Michael D. Plummer. Matching theory. AMS Chelsea Publishing, Providence, RI, 2009. Google Scholar
  14. Dániel Marx. A parameterized view on matroid optimization problems. Theoretical Computers Science, 410(44):4471-4479, 2009. Google Scholar
  15. Luke Mathieson and Stefan Szeider. Editing graphs to satisfy degree constraints: A parameterized approach. J. Comput. Syst. Sci., 78(1):179-191, 2012. Google Scholar
  16. Moni Naor, Leonard J. Schulman, and Aravind Srinivasan. Splitters and near-optimal derandomization. In Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS), pages 182-191. IEEE, 1995. Google Scholar
  17. James G. Oxley. Matroid theory, volume 21 of Oxford Graduate Texts in Mathematics. Oxford university press, 2nd edition, 2010. Google Scholar
  18. Julius Petersen. Die Theorie der regulären graphs. Acta Math., 15(1):193-220, 1891. URL: http://dx.doi.org/10.1007/BF02392606.
  19. Michael D. Plummer. Graph factors and factorization: 1985-2003: A survey. Discrete Mathematics, 307(7-8):791-821, 2007. Google Scholar
  20. Virginia Vassilevska Williams. Multiplying matrices faster than Coppersmith-Winograd. In Proceedings of the 44th Annual ACM Symposium on Theory of Computing (STOC), pages 887-898. ACM, 2012. Google Scholar
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

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