Zobrazeno 1 - 10
of 85
pro vyhledávání: '"Eiji Miyano"'
Publikováno v:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. :1211-1222
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::794b5dd80c97ee4ba88b80073c0a2cdc
https://doi.org/10.1587/transfun.2021dmp0017
https://doi.org/10.1587/transfun.2021dmp0017
Publikováno v:
Journal of Combinatorial Optimization. 44:877-893
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f4f03e62d907451c8fbcf2a245a6570a
https://doi.org/10.1007/s10878-022-00865-y
https://doi.org/10.1007/s10878-022-00865-y
Publikováno v:
Theoretical Computer Science. 900:53-78
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::548a8f0d1e86343509318aff01413b83
https://doi.org/10.1016/j.tcs.2021.11.019
https://doi.org/10.1016/j.tcs.2021.11.019
Autor:
Kenya Kobayashi, Guohui Lin, Eiji Miyano, Toshiki Saitoh, Akira Suzuki, Tadatoshi Utashima, Tsuyoshi Yagita
Publikováno v:
Algorithmica.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::92ce15489b3ef2b7d768248c88cf1a46
https://doi.org/10.1007/s00453-023-01106-2
https://doi.org/10.1007/s00453-023-01106-2
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031304477
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1a4577b77ba32ae0ecd06c4d32c45264
https://doi.org/10.1007/978-3-031-30448-4_4
https://doi.org/10.1007/978-3-031-30448-4_4
Publikováno v:
Discrete Applied Mathematics. 304:32-44
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e5ea952f6a0ab52547d480b9f0ab2f0c
https://doi.org/10.1016/j.dam.2021.07.005
https://doi.org/10.1016/j.dam.2021.07.005
Publikováno v:
Theoretical Computer Science. 882:77-108
An acyclic edge coloring of a graph G is a proper edge coloring such that no bichromatic cycles are produced. The acyclic edge coloring conjecture by Fiamcik (1978) and Alon, Sudakov and Zaks (2001) states that every simple graph with maximum degree
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d98126d23ade3a88ced718b688e5fdb0
https://doi.org/10.1016/j.tcs.2021.06.017
https://doi.org/10.1016/j.tcs.2021.06.017
Publikováno v:
International Journal of Foundations of Computer Science. 32:209-233
The goal of an outdegree-constrained edge-modification problem is to find a spanning subgraph or supergraph [Formula: see text] of an input undirected graph [Formula: see text] such that either: (Type I) the number of edges in [Formula: see text] is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::acc075b5c845ea5d228ebbba7905be5a
https://doi.org/10.1142/s012905412150012x
https://doi.org/10.1142/s012905412150012x
Publikováno v:
Discrete Applied Mathematics. 288:91-113
This paper studies the following variant of clustering or laying out problems for directed acyclic graphs (DAG for short), called the minimum block transfer problem. The objective of this problem is to find a partition of a node set which satisfies t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::45ce2a71bcd25e96990c6262a8e2e8d9
https://doi.org/10.1016/j.dam.2020.08.005
https://doi.org/10.1016/j.dam.2020.08.005
Publikováno v:
Theoretical Computer Science. 844:16-25
The Minimum Maximum Outdegree Problem (MMO) is to assign a direction to every edge in an input undirected, edge-weighted graph so that the maximum weighted outdegree taken over all vertices becomes as small as possible. In this paper, we introduce a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5dd7e7ed76b88f5e8e23d0c319977b44
https://doi.org/10.1016/j.tcs.2020.07.013
https://doi.org/10.1016/j.tcs.2020.07.013