779 search results - page 10 / 156 » A graph polynomial for independent sets of bipartite graphs |
CEC
2008
IEEE
14 years 2 months ago
2008
IEEE
— Recently it has been proved that the (1+1)-EA produces poor worst-case approximations for the vertex cover problem. In this paper the result is extended to the (1+λ)-EA by pro...
DM
1999
13 years 8 months ago
1999
We characterize bipartite Steinhaus graphs in three ways by partitioning them into four classes and we describe the color sets for each of these classes. An interesting recursion ...
COMBINATORICS
2004
13 years 8 months ago
2004
A graph G is well-covered if every maximal independent set has the same cardinality. Let sk denote the number of independent sets of cardinality k, and define the independence pol...
STACS
1994
Springer
14 years 15 days ago
1994
Springer
The complexity of the simple maxcut problem is investigated for several special classes of graphs. It is shown that this problem is NP-complete when restricted to one of the follo...
GBRPR
2007
Springer
14 years 2 months ago
2007
Springer
In the field of structural pattern recognition graphs constitute a very common and powerful way of representing patterns. In contrast to string representations, graphs allow us to ...