3211 search results - page 155 / 643 » On the Grundy Number of a Graph |
153
click to vote
CG
2007
Springer
15 years 6 months ago
2007
Springer
In this paper, we describe a new optical tracking algorithm for pose estimation of interaction devices in virtual and augmented reality. Given a 3D model of the interaction device...
158
click to vote
JGT
2007
15 years 6 months ago
2007
A well-known theorem of Mader [5] states that highly connected subgraphs can be forced in finite graphs by assuming a high minimum degree. Solving a problem of Diestel [2], we ex...
161
click to vote
INFOVIS
2005
IEEE
16 years 15 hour ago
2005
IEEE
The most common approach to support analysis of graphs with associated time series data include: overlay of data on graph vertices for one timepoint at a time by manipulating a vi...
219
click to vote
DCOSS
2008
Springer
15 years 8 months ago
2008
Springer
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
143
click to vote
DM
2008
15 years 6 months ago
2008
Let G = (V, E) be a graph. A set S V is a total restrained dominating set if every vertex is adjacent to a vertex in S and every vertex of V - S is adjacent to a vertex in V - S....