Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Asahi TAKAOKA"'
Autor:
Asahi Takaoka
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 44, Iss 3, p 1023 (2024)
Externí odkaz:
https://doaj.org/article/66dac55784fa4b9eb6407755866c7360
Autor:
Asahi Takaoka
Publikováno v:
Algorithms, Vol 11, Iss 9, p 140 (2018)
The Hamiltonian cycle reconfiguration problem asks, given two Hamiltonian cycles C 0 and C t of a graph G, whether there is a sequence of Hamiltonian cycles C 0 , C 1 , … , C t such that C i can be obtained from C i − 1 by a switch for each i wit
Externí odkaz:
https://doaj.org/article/565d022980074d7086a1a1a4e40affa1
Autor:
Asahi TAKAOKA
Publikováno v:
IEICE ESS Fundamentals Review. 16:17-23
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::16fee8d9e04dbcc6d7b4b59e7f99c311
https://doi.org/10.1587/essfr.16.1_17
https://doi.org/10.1587/essfr.16.1_17
Autor:
Asahi TAKAOKA
Publikováno v:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::df01f7cf1db7265db6ada4450df2073e
https://doi.org/10.1587/transfun.2022eal2103
https://doi.org/10.1587/transfun.2022eal2103
Autor:
Asahi Takaoka
Publikováno v:
Discrete Applied Mathematics. 294:253-256
The class of adjusted interval digraphs is a generalization of interval graphs. Although an O ( n 4 ) -time recognition algorithm is known (where n is the number of vertices of the graph), finding a more efficient algorithm remains an open question.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a1e11cdaa78f5a848f67c79e898e37e2
https://doi.org/10.1016/j.dam.2021.02.014
https://doi.org/10.1016/j.dam.2021.02.014
Autor:
Asahi Takaoka
Publikováno v:
Discrete Applied Mathematics. 282:196-207
A simple-triangle graph is the intersection graph of triangles that are defined by a point on a horizontal line and an interval on another horizontal line. The time complexity of the recognition problem for simple-triangle graphs was a longstanding o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b5d9b972454d39240618207b5ecdef4e
https://doi.org/10.1016/j.dam.2019.11.009
https://doi.org/10.1016/j.dam.2019.11.009
Autor:
Asahi Takaoka
Publikováno v:
Discrete Mathematics. 341:3281-3287
Consider two horizontal lines in the plane. A pair of a point on the top line and an interval on the bottom line defines a triangle between two lines. The intersection graph of such triangles is called a simple-triangle graph. This paper shows a vert
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::141fda2e066a4a5bb9161389ed036708
https://doi.org/10.1016/j.disc.2018.08.009
https://doi.org/10.1016/j.disc.2018.08.009
Publikováno v:
Discrete Applied Mathematics. 201:201-212
An orthogonal ray graph is an intersection graph of horizontal rays (closed half-lines) and vertical rays in the plane, which is introduced in connection with the defect-tolerant design of nano-circuits. An orthogonal ray graph is a 3-directional ort
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::167d414c294f8c74f676923d8524640f
https://doi.org/10.1016/j.dam.2015.07.034
https://doi.org/10.1016/j.dam.2015.07.034
Publikováno v:
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS. (8):1592-1595
A 2-directional orthogonal ray graph is an intersection graph of rightward rays (half-lines) and downward rays in the plane. We show a dynamic programming algorithm that solves the weighted dominating set problem in O(n(3)) time for 2-directional ort
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::92459f3319b1acae6ed0fe80b7e4e105
http://hdl.handle.net/10258/00010202
http://hdl.handle.net/10258/00010202
Publikováno v:
IEICE Transactions on Information and Systems. :2199-2206
SUMMARY The harmonious coloring of an undirected simple graph is a vertex coloring such that adjacent vertices are assigned different colors and each pair of colors appears together on at most one edge. The harmonious chromatic number of a graph is t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b35b82e1a9576709cc809001fe524a57
https://doi.org/10.1587/transinf.2015edp7113
https://doi.org/10.1587/transinf.2015edp7113