438 search results - page 7 / 88 » On Perfect Switching Classes |
CP
2008
Springer
13 years 9 months ago
2008
Springer
By using recent results from graph theory, including the Strong Perfect Graph Theorem, we obtain a unifying framework for a number of tractable classes of constraint problems. Thes...
SIAMDM
2010
13 years 5 months ago
2010
A connected graph G is called t-perfect if its stable set polytope is determined by the non-negativity, edge and odd-cycle inequalities. Moreover, G is called strongly t-perfect i...
PCI
2005
Springer
14 years 29 days ago
2005
Springer
Abstract. In this paper, we address the problem of computing a maximum-size subgraph of a P4-sparse graph which admits a perfect matching; in the case where the graph has a perfect...
ISAAC
2007
Springer
14 years 1 months ago
2007
Springer
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
Abstract-- We investigate observability of switched differential algebraic equations. The article primarily focuses on a class of switched systems comprising of two modes and a swi...