Cargando…
Flip Distances Between Graph Orientations
Flip graphs are a ubiquitous class of graphs, which encode relations on a set of combinatorial objects by elementary, local changes. Skeletons of associahedra, for instance, are the graphs induced by quadrilateral flips in triangulations of a convex polygon. For some definition of a flip graph, a na...
Autores principales: | Aichholzer, Oswin, Cardinal, Jean, Huynh, Tony, Knauer, Kolja, Mütze, Torsten, Steiner, Raphael, Vogtenhuber, Birgit |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer US
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7846516/ https://www.ncbi.nlm.nih.gov/pubmed/33583986 http://dx.doi.org/10.1007/s00453-020-00751-1 |
Ejemplares similares
-
Pointed drawings of planar graphs()
por: Aichholzer, Oswin, et al.
Publicado: (2012) -
Perfect k-Colored Matchings and [Formula: see text] -Gonal Tilings
por: Aichholzer, Oswin, et al.
Publicado: (2018) -
Blocking Delaunay triangulations
por: Aichholzer, Oswin, et al.
Publicado: (2013) -
Extreme point and halving edge search in abstract order types
por: Aichholzer, Oswin, et al.
Publicado: (2013) -
Connectivity of Triangulation Flip Graphs in the Plane
por: Wagner, Uli, et al.
Publicado: (2022)