Dynamic Programming and Fast Matrix Multiplication

DOI10.1007/11841036_27zbMath1131.68484MaRDI QIDQ5449535

Frederic Dorn

Publication date: 11 March 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11841036_27

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

68Q25: Analysis of algorithms and problem complexity

68W05: Nonnumerical algorithms

68R10: Graph theory (including graph drawing) in computer science

90C39: Dynamic programming

Related Items

Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms, (Total) vector domination for graphs with bounded branchwidth, New analysis and computational study for the planar connected dominating set problem, A strengthened analysis of an algorithm for dominating set in planar graphs, Subexponential parameterized algorithms, Confronting intractability via parameters, Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms, On the minimum corridor connection problem and other generalized geometric problems, Dynamic programming and planarity: improved tree-decomposition based algorithms, Computational study on planar dominating set problem, The role of planarity in connectivity problems parameterized by treewidth, Graph Minors and Parameterized Algorithm Design, On the Boolean-Width of a Graph: Structure and Applications, Subexponential Fixed-Parameter Algorithms for Partial Vector Domination, A Linear Kernel for Planar Feedback Vertex Set, How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms, Boolean-Width of Graphs