Parameterizing edge modification problems above lower bounds (Q1635817): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 6 users not shown)
aliases / en / 0aliases / en / 0
 
Parameterizing Edge Modification Problems Above Lower Bounds
description / endescription / en
scientific article
scientific article; zbMATH DE number 6605919
Property / title
 
Parameterizing Edge Modification Problems Above Lower Bounds (English)
Property / title: Parameterizing Edge Modification Problems Above Lower Bounds (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1386.68074 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-319-34171-2_5 / rank
 
Normal rank
Property / published in
 
Property / published in: Computer Science – Theory and Applications / rank
 
Normal rank
Property / publication date
 
25 July 2016
Timestamp+2016-07-25T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 25 July 2016 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6605919 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2578359728 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2253466184 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1512.04047 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranking Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Lower Bounds and Dichotomy Results for the NP-completeness of H-free Edge Modification Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernels for feedback arc set in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards optimal and expressive kernelization for \(d\)-hitting set / rank
 
Normal rank
Property / cites work
 
Property / cites work: A golden ratio parameterized algorithm for cluster editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Going weighted: parameterized algorithms for cluster editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Generating Triangle-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability of graph modification problems for hereditary properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \(2k\) kernel for the cluster editing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Multiway Cut Parameterized above Lower Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Raising The Bar For V<scp>ertex</scp> C<scp>over</scp>: Fixed-parameter Tractability Above A Higher Guarantee / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated generation of search tree algorithms for hard graphs modification problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster editing with locally bounded modifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-hard problems in hierarchical-tree clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: The node-deletion problem for hereditary properties is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Parameterized Algorithms Using Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterizing above Guaranteed Values: MaxSat and MaxCut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict Packing Yields Linear Vertex-Kernels for k -FAST, k -dense RTI and a Related Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost 2-SAT is fixed-parameter tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster graph modification problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Deletion Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast FAST / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterizing edge modification problems above lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incompressibility of \(H\)-free edge modification problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring the Subexponential Complexity of Completion Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-based data clustering with overlaps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact exponential algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential Parameterized Algorithm for Computing the Cutwidth of a Semi-complete Digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for parameterized complexity of Cluster Editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A more effective linear kernelization for cluster editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isolation concepts for efficiently enumerating dense subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial kernelizations for MIN \(F^{+}\Pi _{1}\) and MAX NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4967164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Edge Modification Problems without Polynomial Kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and parameterized algorithms for cograph editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear kernel for \textsc{Rooted Triplet Inconsistency} and other problems based on conflict packing technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying modular decomposition to parameterized cluster editing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized algorithms for feedback set problems and their duals in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Lower Bound and Improved Kernel for Diamond-free Edge Deletion / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:57, 15 July 2024

scientific article; zbMATH DE number 6605919
  • Parameterizing Edge Modification Problems Above Lower Bounds
Language Label Description Also known as
English
Parameterizing edge modification problems above lower bounds
scientific article; zbMATH DE number 6605919
  • Parameterizing Edge Modification Problems Above Lower Bounds

Statements

Parameterizing edge modification problems above lower bounds (English)
0 references
Parameterizing Edge Modification Problems Above Lower Bounds (English)
0 references
0 references
0 references
0 references
0 references
0 references
1 June 2018
0 references
25 July 2016
0 references
0 references
0 references
0 references
0 references
0 references
NP-hard problem
0 references
fixed-parameter algorithm
0 references
subgraph packing
0 references
kernelization
0 references
graph-based clustering
0 references
feedback arc set
0 references
cluster editing
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references