144
click to vote
TCS
2016
10 years 15 days ago
2016
We describe combinatorial games on graphs in which two players antagonistically build a representation of a subgraph of a given graph. We show that for a large class of these game...
130
Voted
TCS
2016
10 years 15 days ago
2016
Abstract. A covering projection from a graph G to a graph H is a mapping of the vertices of G to the vertices of H such that, for every vertex v of G, the neighborhood of v is mapp...
132
click to vote
TCS
2016
10 years 15 days ago
2016
Abstract. The idea of (combinatorial) Gray codes is to list objects in question in such a way that two successive objects differ in some pre-specified small way. In this paper, w...
110
click to vote
TCOM
2016
10 years 15 days ago
2016
—In modern tape storage, user data are recorded and retrieved along multiple tracks of rapidly moving, flexible magnetic medium that give rise to a variety of channel impediment...