Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Haruka Mizuta"'
Autor:
Nicolas Bousquet, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa
Publikováno v:
Algorithmica.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c804d18026920620e16c2e29a867c7bf
https://doi.org/10.1007/s00453-023-01117-z
https://doi.org/10.1007/s00453-023-01117-z
Autor:
Takehiro Ito, Yusuke Kobayashi, Marthe Bonamy, Marc Heinrich, Akira Suzuki, Haruka Mizuta, Moritz Mühlenthaler, Kunihiro Wasa
Publikováno v:
Theoretical Computer Science. 838:45-57
Given a k-coloring of a graph G, a Kempe-change for two colors a and b produces another k-coloring of G, as follows: first choose a connected component in the subgraph of G induced by the two color classes of a and b, and then swap the colors a and b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a2453e6ad97240ff508d51e540406cb3
https://doi.org/10.1016/j.tcs.2020.05.033
https://doi.org/10.1016/j.tcs.2020.05.033
Publikováno v:
Journal of Combinatorial Optimization. 43:1264-1279
Suppose that we are given an independent set \(I_0\) of a graph G, and an integer \(l\ge 0\). Then, we are asked to find an independent set of G having the maximum size among independent sets that are reachable from \(I_0\) by either adding or removi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6800fe3f0ae1adb23384a57d08d2d5a1
https://doi.org/10.1007/s10878-020-00630-z
https://doi.org/10.1007/s10878-020-00630-z
Publikováno v:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. :1532-1540
We study a reconfiguration problem for Steiner trees in an unweighted graph, which determines whether there exists a sequence of Steiner trees that transforms a given Steiner tree into another one by exchanging a single edge at a time. In this paper,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::01a01e3348ebb38392a0e638b4307ac5
https://doi.org/10.1587/transfun.e100.a.1532
https://doi.org/10.1587/transfun.e100.a.1532
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030261757
COCOON
COCOON
Suppose that we are given an independent set \(I_0\) of a graph G, and an integer \(l\ge 0\). Then, we are asked to find an independent set of G having the maximum size among independent sets that are reachable from \(I_0\) by either adding or removi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f40b7a2b045f74a1d6ad3d5f931f7006
https://doi.org/10.1007/978-3-030-26176-4_26
https://doi.org/10.1007/978-3-030-26176-4_26
Autor:
Akira Suzuki, Marthe Bonamy, Haruka Mizuta, Kunihiro Wasa, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler, Marc Heinrich
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030261757
COCOON
COCOON
Given a k-coloring of a graph G, a Kempe-change for two colors a and b produces another k-coloring of G, as follows: first choose a connected component in the subgraph of G induced by the two color classes of a and b, and then swap the colors a and b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::647559a473f50912f155f9e1594823c1
https://doi.org/10.1007/978-3-030-26176-4_5
https://doi.org/10.1007/978-3-030-26176-4_5
Publikováno v:
Combinatorial Algorithms
IWOCA 2020
IWOCA 2020, Jun 2020, Bordeaux, France
Lecture Notes in Computer Science ISBN: 9783030489656
IWOCA
IWOCA 2020
IWOCA 2020, Jun 2020, Bordeaux, France
Lecture Notes in Computer Science ISBN: 9783030489656
IWOCA
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::507d2d15894b9d0ac2e7aeed4ce10406
Autor:
Benjamin Moore, Akira Suzuki, Tesshu Hanaka, Haruka Mizuta, Takehiro Ito, Naomi Nishimura, Vijay Subramanya, Krishna Vaidyanathan
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cad0add1bb83cf6d0c7037bfb6abcaa8
http://arxiv.org/abs/1803.06074
http://arxiv.org/abs/1803.06074
Autor:
Akira Suzuki, Tesshu Hanaka, Krishna Vaidyanathan, Haruka Mizuta, Benjamin Moore, Vijay Subramanya, Takehiro Ito, Naomi Nishimura
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319947754
COCOON
COCOON
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:
https://explore.openaire.eu/search/publication?articleId=doi_________::f4103a6e1e4ed3949f15e8d4c9cb638b
https://doi.org/10.1007/978-3-319-94776-1_36
https://doi.org/10.1007/978-3-319-94776-1_36
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319445427
IWOCA
IWOCA
We study a reconfiguration problem for Steiner trees in an unweighted graph, which determines whether there exists a sequence of Steiner trees that transforms a given Steiner tree into another one by exchanging a single edge at a time. In this paper,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b12bb3b3043f4d16db44decf9af83578
https://doi.org/10.1007/978-3-319-44543-4_13
https://doi.org/10.1007/978-3-319-44543-4_13