Flip distances between graph orientations

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F19%3A10400340" target="_blank" >RIV/00216208:11320/19:10400340 - isvavai.cz</a>

Result on the web

<a href="https://doi.org/10.1007/978-3-030-30786-8_10" target="_blank" >https://doi.org/10.1007/978-3-030-30786-8_10</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-030-30786-8_10" target="_blank" >10.1007/978-3-030-30786-8_10</a>

Result language

angličtina

Original language name

Flip distances between graph orientations

Original language description

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 natural computational problem to consider is the flip distance: Given two objects, what is the minimum number of flips needed to transform one into the other?

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

10101 - Pure mathematics

Project

<a href="/en/project/GA19-08554S" target="_blank" >GA19-08554S: Structures and algorithms in highly symmetric graphs</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2019

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Lecture Notes in Computer Science

ISBN

978-3-030-30785-1

ISSN

0302-9743

e-ISSN

—

Number of pages

15

Pages from-to

120-134

Publisher name

Springer

Place of publication

New York

Event location

Vall de Nuria, Spain

Event date

Jun 19, 2019

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—