Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Mizuta, Haruka"'
Autor:
Bousquet, Nicolas, Ito, Takehiro, Kobayashi, Yusuke, Mizuta, Haruka, Ouvrard, Paul, Suzuki, Akira, Wasa, Kunihiro
We investigate the complexity of finding a transformation from a given spanning tree in a graph to another given spanning tree in the same graph via a sequence of edge flips. The exchange property of the matroid bases immediately yields that such a t
Externí odkaz:
http://arxiv.org/abs/2201.04354
Autor:
Bousquet, Nicolas, Ito, Takehiro, Kobayashi, Yusuke, Mizuta, Haruka, Ouvrard, Paul, Suzuki, Akira, Wasa, Kunihiro
Let $G$ be a graph and $T_1,T_2$ be two spanning trees of $G$. We say that $T_1$ can be transformed into $T_2$ via an edge flip if there exist two edges $e \in T_1$ and $f$ in $T_2$ such that $T_2= (T_1 \setminus e) \cup f$. Since spanning trees form
Externí odkaz:
http://arxiv.org/abs/2006.14309
Given a dominating set, how much smaller a dominating set can we find through elementary operations? Here, we proceed by iterative vertex addition and removal while maintaining the property that the set forms a dominating set of bounded size. This ca
Externí odkaz:
http://arxiv.org/abs/1906.05163
We introduce a new framework for reconfiguration problems, and apply it to independent sets as the first example. Suppose that we are given an independent set $I_0$ of a graph $G$, and an integer $l \ge 0$ which represents a lower bound on the size o
Externí odkaz:
http://arxiv.org/abs/1804.09422
Autor:
Hanaka, Tesshu, Ito, Takehiro, Mizuta, Haruka, Moore, Benjamin, Nishimura, Naomi, Subramanya, Vijay, Suzuki, Akira, Vaidyanathan, Krishna
Subgraph reconfiguration is a family of problems focusing on the reachability of the solution space in which feasible solutions are subgraphs, represented either as sets of vertices or sets of edges, satisfying a prescribed graph structure property.
Externí odkaz:
http://arxiv.org/abs/1803.06074
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Journal of Combinatorial Optimization; Jul2022, Vol. 43 Issue 5, p1264-1279, 16p
Autor:
Bonamy, Marthe, Heinrich, Marc, Ito, Takehiro, Kobayashi, Yusuke, Mizuta, Haruka, Mühlenthaler, Moritz, Suzuki, Akira, Wasa, Kunihiro
Publikováno v:
37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020, March 10-13, 2020, Montpellier, France
37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020, March 10-13, 2020, Montpellier, France, 2020, Montpellier, France. pp.35:1--35:14, ⟨10.4230/LIPIcs.STACS.2020.35⟩
37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020, March 10-13, 2020, Montpellier, France, 2020, Montpellier, France. pp.35:1--35:14, ⟨10.4230/LIPIcs.STACS.2020.35⟩
A k-coloring of a graph maps each vertex of the graph to a color in {1, 2, …, k}, such that no two adjacent vertices receive the same color. Given a k-coloring of a graph, a Kempe change produces a new k-coloring by swapping the colors in a bicolor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a23bf75d00af056f2092db1e8749f3cc
https://hal.archives-ouvertes.fr/hal-02527059
https://hal.archives-ouvertes.fr/hal-02527059
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.