Sciweavers

419 search results - page 3 / 84
» Constraint models for graceful graphs
Sort
View
EUROPAR
1999
Springer
15 years 4 months ago
A New Algorithm for Multi-objective Graph Partitioning
Recently, a number of graph partitioning applications have emerged with additional requirements that the traditional graph partitioning model alone cannot e ectively handle. One s...
Kirk Schloegel, George Karypis, Vipin Kumar
EDBT
2009
ACM
118views Database» more  EDBT 2009»
15 years 7 months ago
Flexible query answering on graph-modeled data
The largeness and the heterogeneity of most graph-modeled datasets in several database application areas make the query process a real challenge because of the lack of a complete ...
Federica Mandreoli, Riccardo Martoglia, Giorgio Vi...
EPIA
2007
Springer
15 years 6 months ago
GRASPER
In this paper we present GRASPER, a graph constraint solver, based on set constraints. We specify GRASPER’s constraints and we make use of our framework to model a problem in the...
Ruben Duarte Viegas, Francisco Azevedo
83
Voted
AIPS
2006
15 years 1 months ago
Incremental Maintenance of Double Precedence Graphs: A Constraint-Based Approach
Reasoning on precedence relations is crucial for many planning and scheduling systems. In this paper we propose a double precedence graph where direct precedence relations are kep...
Roman Barták, Ondrej Cepek
ENTCS
2007
190views more  ENTCS 2007»
14 years 11 months ago
Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
Stefano Bistarelli, Ugo Montanari, Francesca Rossi...