1163 search results - page 171 / 233 » Embedding into Bipartite Graphs |
WSDM
2010
ACM
14 years 5 months ago
2010
ACM
We study the fundamental problem of computing distances between nodes in large graphs such as the web graph and social networks. Our objective is to be able to answer distance que...
ISLPED
2003
ACM
14 years 1 months ago
2003
ACM
We propose a novel power-aware task scheduling algorithm for DVS-enabled real-time multiprocessor systems. Unlike the existing algorithms, the proposed DVS algorithm can handle co...
WADT
1997
Springer
14 years 14 days ago
1997
Springer
The dynamic behavior of rule-based systems (like term rewriting systems 24], process algebras 27], and so on) can be traditionally determined in two orthogonal ways. Either operati...
GD
1995
Springer
13 years 12 months ago
1995
Springer
It is a di cult problem to display large, complex graphs in a manner which furthers comprehension. A useful approach is to expand selected sections foci of the graph revealing de...
DCOSS
2008
Springer
13 years 10 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...