656 search results - page 8 / 132 » Graph Theoretical Characterization and Computation of Answer... |
STACS
2010
Springer
14 years 2 months ago
2010
Springer
We present a method for reducing the treewidth of a graph while preserving all the minimal s−t separators. This technique turns out to be very useful in the design of parameteriz...
SCCC
2005
IEEE
14 years 1 months ago
2005
IEEE
Databases may not satisfy integrity constraints (ICs) for several reasons. Nevertheless, in most of the cases an important part of the data is still consistent wrt certain desired...
KRDB
2003
13 years 8 months ago
2003
The Polylog framework is designed to provide a language for efficiently automating complex queries of information represented in multiple formats. A Polylog program contains a set...
DALT
2008
Springer
13 years 9 months ago
2008
Springer
This paper provides a logical framework of negotiating agents who have capabilities of evaluating and building proposals. Given a proposal, an agent decides whether it is acceptabl...
WG
2007
Springer
14 years 1 months ago
2007
Springer
Kelly-width is a parameter of directed graphs recently proposed by Hunter and Kreutzer as a directed analogue of treewidth. We give several alternative characterizations of direct...