3204 search results - page 283 / 641 » The b-chromatic Number of a Graph |
185
click to vote
WEA
2005
Springer
16 years 6 days ago
2005
Springer
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...
219
click to vote
SI3D
2003
ACM
15 years 12 months ago
2003
ACM
In this paper we develop an interactive 3D browser for large topographic maps using a visual display augmented by a haptic, or force feedback, display. The extreme size of our dat...
221
click to vote
SWAT
2010
Springer
15 years 11 months ago
2010
Springer
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
196
click to vote
SIGCOMM
1998
ACM
15 years 11 months ago
1998
ACM
Many emerging applications (e.g., teleconference, real-time information services, pay per view, distributed interactive simulation, and collaborative work) are based upon a group ...
170
click to vote
COMAD
2009
15 years 7 months ago
2009
Identifying communities in social networks is a problem of great interest. One popular type of community is where every member of the community knows all others, which can be view...