438 search results - page 30 / 88 » On Perfect Switching Classes |
ENDM
2008
13 years 8 months ago
2008
A graph G is clique-perfect if the cardinality of a maximum clique-independent set of H equals the cardinality of a minimum clique-transversal of H, for every induced subgraph H o...
JMLR
2002
13 years 8 months ago
2002
In this paper we prove the so-called "Meek Conjecture". In particular, we show that if a DAG H is an independence map of another DAG G, then there exists a finite sequen...
ALGOSENSORS
2009
Springer
14 years 3 months ago
2009
Springer
In this paper we consider the model of communication where wireless devices can either switch their radios off to save energy (and hence, can neither send nor receive messages), o...
GLOBECOM
2007
IEEE
14 years 3 months ago
2007
IEEE
— In future networks based on the Differentiated Services (DiffServ) architecture, users may be provided with the opportunity to choose their Assured Forwarding (AF) class. Users...
SAT
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. In this paper we study NP-hard weighted satisfiability optimization problems for the class 2-CNF providing worst-case upper time bounds. Moreover we consider the monoton...