Search results
From MaRDI portal
- polynomial time 2013-11-11 Paper Cluster Editing 2013-08-05 Paper Even faster parameterized cluster deletion and cluster editing 2013-04-04 Paper A golden...10 bytes (16 words) - 11:49, 8 December 2023
- parametric complexity of graph diameter augmentation 2014-04-16 Paper The cluster deletion problem for cographs 2014-01-24 Paper Arithmetic progressions in sequences...10 bytes (18 words) - 19:43, 11 December 2023
- parameterization of cluster deletion 2023-11-24 Paper https://portal.mardi4nfdi.de/entity/Q5092370 2022-07-21 Paper Cluster deletion on interval graphs...10 bytes (19 words) - 17:24, 24 September 2023
- Type \(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs 2024-01-09 Paper \(s\)-club cluster vertex deletion on interval and...10 bytes (18 words) - 12:12, 24 September 2023
- complexity of \(s\)-club cluster deletion problems 2023-08-14 Paper On the parameterized complexity of s-club cluster deletion problems 2023-08-01 Paper...10 bytes (16 words) - 19:21, 24 September 2023
- edges 2020-05-12 Paper On the relation of strong triadic closure and cluster deletion 2020-02-28 Paper Your rugby mates don't need to know your colleagues:...10 bytes (16 words) - 22:17, 24 September 2023
- fast branching algorithm for cluster vertex deletion 2016-03-09 Paper A Fast Branching Algorithm for Cluster Vertex Deletion 2014-06-24 Paper...10 bytes (16 words) - 09:05, 7 October 2023
- Type \(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs 2024-01-09 Paper \(s\)-club cluster vertex deletion on interval and...10 bytes (16 words) - 05:33, 7 October 2023
- https://portal.mardi4nfdi.de/entity/Q5858876 2021-04-14 Paper A new approximate cluster deletion algorithm for diamond-free graphs 2020-02-03 Paper...10 bytes (16 words) - 02:38, 7 October 2023
- 2014-04-16 Paper The cluster deletion problem for cographs 2014-01-24 Paper BOUNDED SEARCH TREE ALGORITHMS FOR PARAMETRIZED COGRAPH DELETION: EFFICIENT BRANCHING...10 bytes (16 words) - 12:59, 7 October 2023
- complexity of \(s\)-club cluster deletion problems 2023-08-14 Paper On the parameterized complexity of s-club cluster deletion problems 2023-08-01 Paper...10 bytes (16 words) - 19:28, 6 October 2023
- approximation algorithm for the cluster vertex deletion problem 2023-03-14 Paper A tight approximation algorithm for the cluster vertex deletion problem 2021-12-21...10 bytes (16 words) - 23:35, 24 September 2023
- intersection graphs stabbed by a line 2024-03-28 Paper \(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs 2024-01-09 Paper...10 bytes (16 words) - 19:49, 6 October 2023
- Indifference: Unit Interval Vertex Deletion 2010-11-16 Paper Fixed-parameter algorithms for cluster vertex deletion 2010-08-13 Paper Kernelization through...10 bytes (17 words) - 05:33, 7 October 2023
- application to molecular graphs 2020-08-28 Paper A new approximate cluster deletion algorithm for diamond-free graphs 2020-02-03 Paper https://portal.mardi4nfdi...10 bytes (16 words) - 09:49, 7 October 2023
- algorithm for cactus vertex deletion 2022-10-28 Paper Faster algorithm for pathwidth one vertex deletion 2022-05-23 Paper Cluster deletion revisited 2021-10-19...10 bytes (17 words) - 08:58, 7 October 2023
- polytime solvable on tree-cographs 2015-10-16 Paper Complexity of the cluster deletion problem on subclasses of chordal graphs 2015-09-16 Paper The packing...10 bytes (19 words) - 08:10, 7 October 2023
- Sherali-Adams 2023-06-15 Paper A tight approximation algorithm for the cluster vertex deletion problem 2023-03-14 Paper Regular Matroids Have Polynomial Extension...10 bytes (16 words) - 19:36, 24 September 2023
- polytime solvable on tree-cographs 2015-10-16 Paper Complexity of the cluster deletion problem on subclasses of chordal graphs 2015-09-16 Paper Clique-perfectness...10 bytes (18 words) - 10:11, 11 December 2023
- Publication Date of Publication Type Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width 2012-09-25 Paper...10 bytes (16 words) - 15:30, 6 October 2023
