161
click to vote
WG
1995
Springer
15 years 8 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...
127
click to vote
WG
1995
Springer
15 years 8 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...
165
click to vote
WETICE
1995
IEEE
15 years 8 months ago
1995
IEEE
Although there are many quality domains in which ideas and concepts about quality are represented, these representations are often informal. The TOVE Quality Ontology is the forma...
120
click to vote
WETICE
1995
IEEE
15 years 8 months ago
1995
IEEE
In this paper we informally explain a new Trellis model that incorporates colored tokens into the previouslydescribed timed-Petri-net-based de nition. We give examples of using Tr...
