On Generating Triangle-Free Graphs
References (9)
- et al.
Invitation to data reduction and problem kernelization
ACM SIGACT News
(2007) Kernelization algorithms for d-hitting set problems
- et al.
Finding and counting given length cycles
Algorithmica
(1997) - et al.
Automated generation of search tree algorithms for hard graph modification problems
Algorithmica
(2004)
There are more references available in the full text version of this article.
Cited by (37)
A survey of parameterized algorithms and the complexity of edge modification
2023, Computer Science ReviewFeedback edge sets in temporal graphs
2022, Discrete Applied MathematicsKernel for K<inf>t</inf>-FREE EDGE DELETION
2021, Information Processing LettersThe parameterized complexity and kernelization of resilience for database queries
2020, Theoretical Computer ScienceNew kernels for several problems on planar graphs
2020, Theoretical Computer ScienceTriangle edge deletion on planar glasses-free RGB-digraphs
2019, Theoretical Computer ScienceCitation Excerpt :In this paper, we revisit the problem to break all triangles of a given graph by minimizing edge deletions. Triangle edge deletion problem is a variant of feedback arc set problem (refer to [2,4,5]), and it can be formally stated as follows. We have the following observations on RGB-digraphs,
- 1
Student of the Carl-Zeiss-Gymnasium Jena, Erich-Kuithan-Str. 7, D-07743 Jena.
- 2
Supported by a PhD fellowship of the Carl-Zeiss-Stiftung.
- 3
Supported by the Deutsche Forschungsgemeinschaft, project AREG, NI 369/9.
Copyright © 2009 Elsevier B.V. All rights reserved.