# 2 Search Results for "Hoang, Hung P."

Document
##### Drawings of Complete Multipartite Graphs up to Triangle Flips

Authors: Oswin Aichholzer, Man-Kwun Chiu, Hung P. Hoang, Michael Hoffmann, Jan Kynčl, Yannic Maus, Birgit Vogtenhuber, and Alexandra Weinberger

Published in: LIPIcs, Volume 258, 39th International Symposium on Computational Geometry (SoCG 2023)

##### Abstract
For a drawing of a labeled graph, the rotation of a vertex or crossing is the cyclic order of its incident edges, represented by the labels of their other endpoints. The extended rotation system (ERS) of the drawing is the collection of the rotations of all vertices and crossings. A drawing is simple if each pair of edges has at most one common point. Gioan’s Theorem states that for any two simple drawings of the complete graph K_n with the same crossing edge pairs, one drawing can be transformed into the other by a sequence of triangle flips (a.k.a. Reidemeister moves of Type 3). This operation refers to the act of moving one edge of a triangular cell formed by three pairwise crossing edges over the opposite crossing of the cell, via a local transformation. We investigate to what extent Gioan-type theorems can be obtained for wider classes of graphs. A necessary (but in general not sufficient) condition for two drawings of a graph to be transformable into each other by a sequence of triangle flips is that they have the same ERS. As our main result, we show that for the large class of complete multipartite graphs, this necessary condition is in fact also sufficient. We present two different proofs of this result, one of which is shorter, while the other one yields a polynomial time algorithm for which the number of needed triangle flips for graphs on n vertices is bounded by O(n^{16}). The latter proof uses a Carathéodory-type theorem for simple drawings of complete multipartite graphs, which we believe to be of independent interest. Moreover, we show that our Gioan-type theorem for complete multipartite graphs is essentially tight in the following sense: For the complete bipartite graph K_{m,n} minus two edges and K_{m,n} plus one edge for any m,n ≥ 4, as well as K_n minus a 4-cycle for any n ≥ 5, there exist two simple drawings with the same ERS that cannot be transformed into each other using triangle flips. So having the same ERS does not remain sufficient when removing or adding very few edges.

##### Cite as

Oswin Aichholzer, Man-Kwun Chiu, Hung P. Hoang, Michael Hoffmann, Jan Kynčl, Yannic Maus, Birgit Vogtenhuber, and Alexandra Weinberger. Drawings of Complete Multipartite Graphs up to Triangle Flips. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 6:1-6:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)

```@InProceedings{aichholzer_et_al:LIPIcs.SoCG.2023.6,
author =	{Aichholzer, Oswin and Chiu, Man-Kwun and Hoang, Hung P. and Hoffmann, Michael and Kyn\v{c}l, Jan and Maus, Yannic and Vogtenhuber, Birgit and Weinberger, Alexandra},
title =	{{Drawings of Complete Multipartite Graphs up to Triangle Flips}},
booktitle =	{39th International Symposium on Computational Geometry (SoCG 2023)},
pages =	{6:1--6:16},
series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN =	{978-3-95977-273-0},
ISSN =	{1868-8969},
year =	{2023},
volume =	{258},
editor =	{Chambers, Erin W. and Gudmundsson, Joachim},
publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.6},
URN =		{urn:nbn:de:0030-drops-178563},
doi =		{10.4230/LIPIcs.SoCG.2023.6},
annote =	{Keywords: Simple drawings, simple topological graphs, complete graphs, multipartite graphs, k-partite graphs, bipartite graphs, Gioan’s Theorem, triangle flips, Reidemeister moves}
}```
Document
Track A: Algorithms, Complexity and Games
##### A Subexponential Algorithm for ARRIVAL

Authors: Bernd Gärtner, Sebastian Haslebacher, and Hung P. Hoang

Published in: LIPIcs, Volume 198, 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)

##### Abstract
The ARRIVAL problem is to decide the fate of a train moving along the edges of a directed graph, according to a simple (deterministic) pseudorandom walk. The problem is in NP∩coNP but not known to be in 𝖯. The currently best algorithms have runtime 2^Θ(n) where n is the number of vertices. This is not much better than just performing the pseudorandom walk. We develop a subexponential algorithm with runtime 2^O(√nlog n). We also give a polynomial-time algorithm if the graph is almost acyclic. Both results are derived from a new general approach to solve ARRIVAL instances.

##### Cite as

Bernd Gärtner, Sebastian Haslebacher, and Hung P. Hoang. A Subexponential Algorithm for ARRIVAL. In 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 198, pp. 69:1-69:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)

```@InProceedings{gartner_et_al:LIPIcs.ICALP.2021.69,
author =	{G\"{a}rtner, Bernd and Haslebacher, Sebastian and Hoang, Hung P.},
title =	{{A Subexponential Algorithm for ARRIVAL}},
booktitle =	{48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages =	{69:1--69:14},
series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN =	{978-3-95977-195-5},
ISSN =	{1868-8969},
year =	{2021},
volume =	{198},
editor =	{Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.69},
URN =		{urn:nbn:de:0030-drops-141387},
doi =		{10.4230/LIPIcs.ICALP.2021.69},
annote =	{Keywords: Pseudorandom walks, reachability, graph games, switching systems}
}```
• Refine by Author
• 2 Hoang, Hung P.
• 1 Aichholzer, Oswin
• 1 Chiu, Man-Kwun
• 1 Gärtner, Bernd
• 1 Haslebacher, Sebastian

• Refine by Classification
• 1 Human-centered computing → Graph drawings
• 1 Mathematics of computing → Combinatorics
• 1 Mathematics of computing → Graph theory
• 1 Theory of computation → Graph algorithms analysis

• Refine by Keyword
• 1 Gioan’s Theorem
• 1 Pseudorandom walks
• 1 Reidemeister moves
• 1 Simple drawings
• 1 bipartite graphs

• Refine by Type
• 2 document

• Refine by Publication Year
• 1 2021
• 1 2023

X

Feedback for Dagstuhl Publishing