163
Voted
SWAT
15 years 10 months ago
2004 Springer 
We study the following problem: Given a set V of n vertices and a set E of m edge pairs, we define a graph family G(V, E) as the set of graphs that have vertex set V and contain ...
125
click to vote
SWAT
15 years 10 months ago
2004 Springer
In this paper, we consider the problems of generating all maximal (bipartite) cliques in a given (bipartite) graph G = (V, E) with n vertices and m edges. We propose two algorithms...
119
click to vote
SWAT
15 years 10 months ago
2004 Springer 
Given an edge-distance graph of a set of suppliers and clients, the bottleneck problem is to assign each client to a selected supplier minimizing their maximum distance. We introdu...
148
click to vote
SWAT
15 years 10 months ago
2004 Springer
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
129
click to vote
SWAT
15 years 10 months ago
2004 Springer 
We present improved cache-oblivious data structures and algorithms for breadth-first search and the single-source shortest path problem on undirected graphs with non-negative edge...
|
Algorithms