![]() |
![]() |
University of Birmingham > Talks@bham > Combinatorics and Probability Seminar > Graph Decompositions
![]() Graph DecompositionsAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Johannes Carmesin. Chokepoints raise challenges in numerous fields, from everyday traffic and logistics to ancient and digital military strategies. In graph theory, the global chokepoints of any graph allow us to decompose it in a tree-like way into smaller graphs by cutting at the global chokepoints. The basic instance of this idea is the block-cutvertex tree. In practice, however, chokepoints usually are not global in nature, and many graphs are not tree-like. We introduce a new method which allows us to decompose any graph into smaller graphs in an H-like way, where H is a graph simpler than G which represents the global shape of G, by cutting at the local chokepoints of G. Joint work with Carmesin, Diestel, Jacobs and Knappe. This talk is part of the Combinatorics and Probability Seminar series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsType the title of a new list here Bham Talks Particle Physics SeminarsOther talksFnS - Teaching robots to grasp stuff Collective phenomena in excitonic quantum matter TurĂ¡n densities for hypergraph with quasirandom links Optical fiber sensing based on nanostructured coatings Cross-study Bayesian Factor Regression in Heterogeneous High-dimensional Data Gravitational waves from black holes and neutron stars |