Graph and string parameters: connections between pathwidth, cutwidth and the locality number
From MaRDI portal
Cites work
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A note on exact algorithms for vertex ordering problems on graphs
- A partial k-arboretum of graphs with bounded treewidth
- Approximating Pathwidth for Graphs of Small Treewidth
- Characterising REGEX languages by regular languages equipped with factor-referencing
- Computing Pathwidth Faster Than 2 n
- Cutwidth I: A linear time fixed parameter algorithm
- Deterministic regular expressions with back-references
- Developments from enquiries into the learnability of the pattern languages from positive data
- Discontinuities in pattern inference
- Expander flows, geometric embeddings and graph partitioning
- Experimental evaluation of a branch-and-bound algorithm for computing pathwidth and directed pathwidth
- Extended regular expressions: succinctness and decidability
- Finding patterns common to a set of strings
- Fixed-parameter tractability of treewidth and pathwidth
- Fundamentals of parameterized complexity
- Generalized function matching
- Graph and string parameters: connections between pathwidth, cutwidth and the locality number
- Graph expansion and the unique games conjecture
- scientific article; zbMATH DE number 67610 (Why is no real title available?)
- scientific article; zbMATH DE number 1330033 (Why is no real title available?)
- scientific article; zbMATH DE number 566078 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- scientific article; zbMATH DE number 6131601 (Why is no real title available?)
- scientific article; zbMATH DE number 7278096 (Why is no real title available?)
- Improved Approximation Algorithms for Minimum Weight Vertex Separators
- Inapproximability of treewidth and related problems
- Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Graph Partitioning and Quadratic Integer Programming with PSD Objectives
- Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries
- Matching patterns with variables
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
- On matching generalised repetitive patterns
- On the parameterised complexity of string morphism problems
- On the possibility, to travel around a graph without repetition and without cutting
- On the power of unique 2-prover 1-round games
- Parametrized complexity theory.
- Pattern matching with variables: a multivariate complexity analysis
- Pattern matching with variables: fast algorithms and new hardness results
- Patterns with bounded treewidth
- Revisiting Shinohara's algorithm for computing descriptive patterns
- Rounding Semidefinite Programming Hierarchies via Global Correlation
- Subexponential algorithms for unique games and related problems
- The expressibility of languages and relations by word equations
- The PACE 2017 parameterized algorithms and computational experiments challenge: the second iteration
- Topological Bandwidth
- Treewidth. Computations and approximations
This page was built for publication: Graph and string parameters: connections between pathwidth, cutwidth and the locality number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7354554)
