1 citations · 1 across the 5 of their papers we have counts for
6 papers
Star Decompositions of a Cyclic Polygon
Tomoki Nakamigawa
Let be a set of vertices on a circumference in the plane. Let be a set of directed line segments linking two vertices of . If forms a set of closed cycles and for al…
Structural Origins of Cubic Complexity in Pebble Motion
Tomoki Nakamigawa, Tadashi Sakuma
The pebble motion problem (PMP) asks whether one configuration of labeled pebbles on a graph can be transformed into another by moving pebbles to adjacent unoccupied vertices. It i…
A Correspondence between Chord Diagrams and Families of 0-1 Young Diagrams
Tomoki Nakamigawa
A chord diagram is a set of chords in which no pair of chords has a common endvertex. For a chord diagram having a crossing , by the chord expansion of wi…
On the average hitting times of the squares of cycles
Yoshiaki Doi, Norio Konno, Tomoki Nakamigawa +6
The exact formula for the average hitting time (HT, as an abbreviation) of simple random walks from one vertex to any other vertex on the square of an -vertex cycle grap…
Pebble Exchange Group of Graphs
Tatsuoki Kato, Tomoki Nakamigawa, Tadashi Sakuma
A graph puzzle of a graph is defined as follows. A configuration of is a bijection from the set of vertices of a board graph to the set of vertice…
Agent Arrangement Problem
Tomoki Nakamigawa, Tadashi Sakuma
An {\em arrangement} of an ordered pair of graphs is defined as a function from to such that, for each vertex of , the vertex-set $f^{-1…