Algorithms and experiments for parameterized approaches to hard graph problems

zbMATH Open1250.05107MaRDI QIDQ3600916FDOQ3600916

Authors: Falk Hüffner 

Publication date: 6 February 2009

Full work available at URL: http://d-nb.info/989353605/34

Recommendations

• Exact algorithms for difficult graph problems
• Parameterized complexity of even/odd subgraph problems
• The parameterized complexity of some minimum label problems
• The parameterized complexity of some minimum label problems
• scientific article; zbMATH DE number 6515825

zbMATH Keywords

balanced subgraphalgorithmic techniquesclique cover-problemminimum-weight path-problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Extremal problems in graph theory (05C35) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (11)

• Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics
• Iterative Compression for Exactly Solving NP-Hard Minimization Problems
• Quadratic kernelization for convex recoloring of trees
• Fixed-parameter algorithms for cluster vertex deletion
• Algorithms for #BIS-hard problems on expander graphs
• Parameterized algorithms for Graph Burning problem
• A Parametrized Analysis of Algorithms on Hierarchical Graphs
• Fixed-parameter linear-time algorithms for NP-hard graph and hypergraph problems arising in industrial applications
• Title not available (Why is that?)
• Separator-based data reduction for signed graph balancing
• Fixed-parameter tractability results for feedback set problems in tournaments

This page was built for publication: Algorithms and experiments for parameterized approaches to hard graph problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3600916)