BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Jean Cardinal (ULB\, Brussels)
DTSTART:20201013T163000Z
DTEND:20201013T170000Z
DTSTAMP:20260417T203628Z
UID:LA-CoCo/3
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/LA-CoCo/3/">
 Flip distances between graph orientations</a>\nby Jean Cardinal (ULB\, Bru
 ssels) as part of LA Combinatorics and Complexity Seminar\n\n\nAbstract\nF
 lip graphs encode relations induced on a set of combinatorial objects by e
 lementary\, local changes. Skeletons of associahedra\, for instance\, are 
 the graphs induced by quadrilateral flips in triangulations of a convex po
 lygon. For some definition of a flip graph\, a natural computational probl
 em to consider is the flip distance: Given two objects\, what is the minim
 um number of flips needed to transform one into the other? We consider the
  structure and complexity of this problem for orientations of a graph in w
 hich every vertex has a specified outdegree\, and a flip consists of rever
 sing all edges of a directed cycle.\n\nJoint work with Oswin Aichholzer\, 
 Tony Huynh\, Kolja Knauer\, Torsten Mütze\, Raphael Steiner\, and Birgit 
 Vogtenhuber.\n
LOCATION:https://researchseminars.org/talk/LA-CoCo/3/
END:VEVENT
END:VCALENDAR