48 search results - page 6 / 10 » Total interval numbers of complete r-partite graphs |
DAGSTUHL
2006
13 years 8 months ago
2006
It is known that, for every constant k 3, the presence of a k-clique (a complete subgraph on k vertices) in an n-vertex graph cannot be detected by a monotone boolean circuit usi...
AICT
2006
IEEE
14 years 1 months ago
2006
IEEE
— We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem motivated by a traffic grooming application. The MARPG problem consists in finding the ma...
NETWORKS
2007
13 years 7 months ago
2007
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...
INFOCOM
2008
IEEE
14 years 1 months ago
2008
IEEE
Abstract—Recent advances in computer technology and wireless communications have enabled the emergence of stream-based sensor networks. In such sensor networks, real-time data ar...
RTCSA
2005
IEEE
14 years 1 months ago
2005
IEEE
We address in this paper the problem of scheduling for multiprocessor real-time systems with hard and soft tasks. Utility functions are associated to soft tasks to capture their r...