223 search results - page 25 / 45 » On Computing Longest Paths in Small Graph Classes |
115
click to vote
WG
1998
Springer
15 years 6 months ago
1998
Springer
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...
103
click to vote
IPPS
1998
IEEE
15 years 6 months ago
1998
IEEE
List-based priority schedulers have long been one of the dominant classes of static scheduling algorithms. Such heuristics have been predominantly based around the "critical ...
104
Voted
ICALP
2003
Springer
15 years 7 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
120
click to vote
PC
2000
15 years 1 months ago
2000
Multicast, an important communication mechanism, is frequently applied in parallel computing. The star graph interconnection network, when compared with the hypercube network, bei...
121
click to vote
ICDCS
2010
IEEE
15 years 5 months ago
2010
IEEE
Abstract—Policy autonomy exercised by Autonomous Systems (ASes) on the Internet can result in persistent oscillations in Border Gateway Protocol, the Internet’s inter-domain ro...