Sciweavers

5889 search results - page 959 / 1178
» Graph Layout Problems
Sort
View
STOC
1998
ACM
167views Algorithms» more  STOC 1998»
15 years 10 months ago
An Improved Approximation Algorithm for Multiway Cut
Given an undirected graph with edge costs and a subset of k nodes called terminals, a multiway cut is a subset of edges whose removal disconnects each terminal from the rest. Mult...
Gruia Calinescu, Howard J. Karloff, Yuval Rabani
FSTTCS
1998
Springer
15 years 10 months ago
Partial Order Reductions for Bisimulation Checking
Partial order methods have been introduced to avoid the state explosion problem in veri cation resulting from the representation of multiple interleavings of concurrent transitions...
Michaela Huhn, Peter Niebert, Heike Wehrheim
PLILP
1998
Springer
15 years 10 months ago
A Compiler for Rewrite Programs in Associative-Commutative Theories
Abstract. We address the problem of term normalisation modulo associativecommutative (AC) theories, and describe several techniques for compiling many-to-one AC matching and reduce...
Pierre-Etienne Moreau, Hélène Kirchn...
VISUALIZATION
1997
IEEE
15 years 10 months ago
Efficient subdivision of finite-element datasets into consistent tetrahedra
This paper discusses the problem of subdividing unstructured mesh topologies containing hexahedra, prisms, pyramids and tetrahedra into a consistent set of only tetrahedra, while ...
Guy Albertelli, Roger Crawfis
EUROMICRO
1996
IEEE
15 years 10 months ago
Efficient Program Composition on Parix by the Ensemble Methodology
A message passing program composition methodology, called Ensemble, applied for Parix is presented. Ensemble overcomes the implementation problems and complexities in developing a...
John Yiannis Cotronis