154 search results - page 24 / 31 » Odd subgraphs and matchings |
CATS
2008
13 years 11 months ago
2008
G is a well-covered graph provided all its maximal stable sets are of the same size (Plummer, 1970). S is a local maximum stable set of G, and we denote by S (G), if S is a maxim...
AAAI
1994
13 years 11 months ago
1994
Many real-life Constraint Satisfaction Problems (CSPs) involve some constraints similar to the alldifferent constraints. These constraints are called constraints of difference. Th...
JCT
2010
13 years 8 months ago
2010
Abstract. A graph is connected-homogeneous if any isomorphism between finite connected induced subgraphs extends to an automorphism of the graph. In this paper we classify the cou...
ICIP
2009
IEEE
13 years 7 months ago
2009
IEEE
The development of street-level geoviewers become recently a very active and challenging research topic. In this context, the detection, representation and classification of windo...
BMCBI
2008
13 years 9 months ago
2008
Background: Biomedical and chemical databases are large and rapidly growing in size. Graphs naturally model such kinds of data. To fully exploit the wealth of information in these...