On bounded block decomposition problems for under-specified systems of equations

DOI10.1016/J.JCSS.2011.05.011MaRDI QIDQ414888zbMATH OpenOpenAlexFDO

Authors Matthijs Bomhoff, Walter Kern, Georg Still

Publication date 11 May 2012

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://research.utwente.nl/en/publications/on-bounded-block-decomposition-problems-for-underspecified-systems-of-equations(2d979d39-7a5d-4662-856a-b70ec62c3796).html

zbMATH Keywords

decompositionparameterized complexitybipartite graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Menger-decomposition of a graph and its application to the structural analysis of a large-scale system of equations
• Nested Epsilon Decompositions of Linear Systems: Weakly Coupled and Overlapping Blocks
• Reduction of underdetermined systems of ordinary differential equations. IV
• Combinatorial Canonical Form of Layered Mixed Matrices and Its Application to Block-Triangularization of Systems of Linear/Nonlinear Equations
• scientific article; zbMATH DE number 1837489

Cites work

• scientific article; zbMATH DE number 1194938 (Why is no real title available?)
• scientific article; zbMATH DE number 1161563 (Why is no real title available?)
• Computing the block triangular form of a sparse matrix
• Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms
• Coverings of Bipartite Graphs
• Crown reductions for the minimum weighted vertex cover problem
• Crown structures for vertex cover kernelization
• DECOMPOSITION OF GEOMETRIC CONSTRAINT SYSTEMS: A SURVEY
• Fixed-parameter tractability and completeness II: On completeness for W[1]
• Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues
• Graph-Theoretic Concepts in Computer Science
• Matching theory
• On Representatives of Subsets
• On the Inversion of Sparse Matrices
• Systems of Distinct Representatives
• Towards a Taxonomy of Techniques for Designing Parameterized Algorithms

Cited in

(2)

• Nested Epsilon Decompositions of Linear Systems: Weakly Coupled and Overlapping Blocks
• scientific article; zbMATH DE number 4203607 (Why is no real title available?)

Describes a project that uses

Uses Software

• GPDOF

This page was built for publication: On bounded block decomposition problems for under-specified systems of equations

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