123
click to vote
WG
15 years 3 months ago
1995 Springer 
We propose an O(n4) algorithm to build the modular decomposition tree of hypergraphs of dimension 3 and show how this algorithm can be generalized to compute in O(n3k−5) time th...
WG
15 years 3 months ago
1995 Springer 
Abstract. In this paper, we investigate which processor networks allow klabel Interval Routing Schemes, under the assumption that costs of edges may vary. We show that for each xed...
|
Theoretical Computer Science