3471 search results - page 607 / 695 » Obstacle Numbers of Graphs |
144
Voted
MSWIM
2003
ACM
15 years 10 months ago
2003
ACM
An ad hoc network is formed by wireless mobile nodes (hosts) that operate as terminals as well as routers in the network, without any centralized administration. Research in ad ho...
162
Voted
SIGECOM
2003
ACM
15 years 10 months ago
2003
ACM
We examine correlated equilibria in the recently introduced formalism of graphical games, a succinct representation for multiplayer games. We establish a natural and powerful rela...
152
click to vote
VRST
2003
ACM
15 years 10 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...
180
Voted
FSTTCS
2003
Springer
15 years 10 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...
150
click to vote
AINA
2010
IEEE
15 years 10 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...