Tangle and Maximal Ideal
From MaRDI portal
Publication:2980900
DOI10.1007/978-3-319-53925-6_7OpenAlexW2588109031MaRDI QIDQ2980900
Publication date: 5 May 2017
Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-53925-6_7
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tangles, trees, and flowers
- Testing branch-width
- Partitions versus sets: a case of duality
- Submodular partition functions
- Graph minors. X: Obstructions to tree-decomposition
- Quickly excluding a forest
- Graph searching and a min-max theorem for tree-width
- Call routing and the ratcatcher
- On the monotonicity of games generated by symmetric submodular functions.
- Ends and tangles
- Obstructions to branch-decomposition of matroids
- Codensity and the ultrafilter monad
- Unifying Duality Theorems for Width Parameters in Graphs and Matroids (Extended Abstract)