Tangle and Maximal Ideal

DOI10.1007/978-3-319-53925-6_7MaRDI QIDQ2980900zbMATH OpenOpenAlexFDO

Authors Koichi Yamazaki

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

zbMATH Keywords

idealsubmodularitytangle

Mathematics Subject Classification ID

Structure theory of Boolean algebras (06E05)

Recommendations

• Tangles and connectivity in graphs
• Computing with tangles
• Computing with Tangles
• Tangles, trees, and flowers
• Tangles, tree-decompositions and grids in matroids

Cites work

• Call routing and the ratcatcher
• Codensity and the ultrafilter monad
• Ends and tangles
• Graph minors. X: Obstructions to tree-decomposition
• Graph searching and a min-max theorem for tree-width
• scientific article; zbMATH DE number 1057879 (Why is no real title available?)
• scientific article; zbMATH DE number 952954 (Why is no real title available?)
• scientific article; zbMATH DE number 1870231 (Why is no real title available?)
• scientific article; zbMATH DE number 3304085 (Why is no real title available?)
• Obstructions to branch-decomposition of matroids
• On the monotonicity of games generated by symmetric submodular functions.
• Partitions versus sets: a case of duality
• Quickly excluding a forest
• Submodular partition functions
• Tangles, trees, and flowers
• Testing branch-width
• Unifying duality theorems for width parameters in graphs and matroids (extended abstract)

Cited in

(1)

• Tangle and ultrafilter: game theoretical interpretation

This page was built for publication: Tangle and Maximal Ideal

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