154
click to vote
WADS
15 years 6 months ago
2001 Springer 
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...
99
Voted
WADS
15 years 6 months ago
2001 Springer 
In this paper, we consider the problem of finding a mixed upward planarization of a mixed graph, i.e., a graph with directed and undirected edges. The problem is a generalization...
114
Voted
WADS
15 years 6 months ago
2001 Springer 
Methods for ranking World Wide Web resources according to their position in the link structure of the Web are receiving considerable attention, because they provide the first e...
135
click to vote
WADS
15 years 6 months ago
2001 Springer 
Even though a large number of I/O-efficient graph algorithms have been developed, a number of fundamental problems still remain open. For example, no space- and I/O-efficient algo...
WADS
15 years 6 months ago
2001 Springer
We show that there exists a linear time algorithm for deciding whether a graph of bounded tree-width has clique-width k for some fixed integer k. Communicated by Giuseppe Liotta ...
|
Algorithms