Abstract
Finding a maximum acyclic subgraph is on the list of problems that seem to be hard to tackle from a parameterized perspective. We develop two quite efficient algorithms (one is exact, the other parameterized) for (1,n)-graphs, a class containing cubic graphs. The running times are \(\mathcal{O}^*(1.1871^m)\) and \(\mathcal{O}^*(1.212^k)\), respectively, determined by an amortized analysis via a non-standard measure.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bafna, V., Berman, P., Fujito, T.: A 2-approximation algorithm for the undirected feedback vertex set problem. SIAM Journal of Discrete Mathematics 12, 289–297 (1999)
Berger, B., Shor, P.W.: Approximation algorithms for the maximum acyclic subgraph problem. In: SODA, pp. 236–243 (1990)
Chen, J., Fomin, F.V., Liu, Y., Lu, S., Villanger, Y.: Improved algorithms for the feedback vertex set problems. In: WADS, pp. 422–433 (2007)
Chen, J., Liu, Y., Lu, S.: An improved parameterized algorithm for the minimum node multiway cut problem. In: WADS, pp. 495–506 (2007)
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
Fernau, H.: Parameterized algorithms for HITTING SET: The weighted case. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds.) CIAC 2006. LNCS, vol. 3998, pp. 332–343. Springer, Heidelberg (2006)
Festa, P., Pardalos, P.M., Resende, M.G.C.: Feedback set problems. In: Handbook of Combinatorial Optimization, vol. Supplement Volume A, pp. 209–258. Kluwer Academic Publishers, Dordrecht (1999)
Fomin, F.V., Gaspers, S., Pyatkin, A.V.: Finding a minimum feedback set in time \({\cal O}(1.7548^n)\). In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 184–191. Springer, Heidelberg (2006)
Fomin, F.V., Grandoni, F., Kratsch, D.: Measure and conquer: Domination – a case study. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 191–203. Springer, Heidelberg (2005)
Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, Plenum Press, New York (1972)
Mahajan, M., Raman, V., Sikdar, S.: Parameterizing MAXNP problems above guaranteed values. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 38–49. Springer, Heidelberg (2006)
Seminar 07281: Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, Dagstuhl, Germany, July 8-13, 2007, Proceedings (to appear, 2007), http://drops.dagstuhl.de/portals/index.php?semnr=07281 , http://uk.arxiv.org/pdf/0707.0282.pdf (for a pre-version)
Nassi, I., Shneiderman, B.: Flowchart techniques for structured programming. ACM SIGPLAN Notices 12 (1973)
Newman, A.: The maximum acyclic subgraph problem and degree-3 graphs. In: Goemans, M.X., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) RANDOM 2001 and APPROX 2001. LNCS, vol. 2129, pp. 147–158. Springer, Heidelberg (2001)
Raman, V., Saurabh, S.: Improved fixed parameter tractable algorithms for two edge problems: MAXCUT and MAXDAG. Inf. Process. Lett. 104(2), 65–72 (2007)
Razgon, I.: Computing minimum directed feedback vertex set in O(1.9977n). In: ICTCS, vol. 6581, pp. 70–81. World Scientific, Singapore (2007), www.worldscibooks.com/compsci/6581.html
Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical system structures. IEEE Trans. Systems Man Cybernet. 11(2), 109–125 (1981)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fernau, H., Raible, D. (2008). Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs. In: Nakano, Si., Rahman, M.S. (eds) WALCOM: Algorithms and Computation. WALCOM 2008. Lecture Notes in Computer Science, vol 4921. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77891-2_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-77891-2_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77890-5
Online ISBN: 978-3-540-77891-2
eBook Packages: Computer ScienceComputer Science (R0)