3211 search results - page 562 / 643 » On the Grundy Number of a Graph |
166
click to vote
VRST
2003
ACM
15 years 11 months ago
2003
ACM
Virtual environments (VEs) allow users to experience and interact with a rich sensory environment, but most virtual worlds contain only sensory information similar to that which w...
208
click to vote
FSTTCS
2003
Springer
15 years 11 months ago
2003
Springer
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...
164
click to vote
AINA
2010
IEEE
15 years 11 months ago
2010
IEEE
Abstract—Directed Acyclic Graphs (DAGs), rooted at popular/default destinations, have emerged as a preferred mechanism to provide IPv6 routing functionality in large scale low po...
147
click to vote
ICDCS
2002
IEEE
15 years 11 months ago
2002
IEEE
: A reliable multicast algorithm, called RMA, for mobile ad hoc networks is presented that is based on a new cost criterion, called link lifetime, for determining the optimal path ...
185
click to vote
LION
2010
Springer
15 years 11 months ago
2010
Springer
Abstract This paper proposes a flexible software architecture for interactive multiobjective optimization, with a user interface for visualizing the results and facilitating the s...