146 search results - page 8 / 30 » A new characterization of P6-free graphs |
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
ENTCS
2008
13 years 7 months ago
2008
The well-known notion of critical pairs already allows a static conflict detection, which is important for all kinds of applications and already implemented in AGG. Unfortunately ...
EUROMICRO
2003
IEEE
14 years 23 days ago
2003
IEEE
Recently, several languages for web service composition have emerged (e.g., BPEL4WS and WSCI). The goal of these languages is to glue web services together in a process-oriented w...
DAC
1996
ACM
13 years 11 months ago
1996
ACM
The development of new Field-Programmed, MaskProgrammed and Laser-Programmed Gate Array architectures is hampered by the lack of realistic test circuits that exercise both the arc...
ICCS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. In this paper, we extend Simple Conceptual Graphs with Reiter’s default rules. The motivation for this extension came from the type of reasonings involved in an agronom...