779 search results - page 25 / 156 » A graph polynomial for independent sets of bipartite graphs |
CORR
2010
Springer
14 years 9 months ago
2010
Springer
A dominating set D of a graph G = (V, E) is a subset of vertices such that every vertex in V \ D has at least one neighbour in D. Moreover if D is an independent set, i.e. no verti...
BIRTHDAY
2010
Springer
14 years 10 months ago
2010
Springer
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
AAIM
2007
Springer
15 years 3 months ago
2007
Springer
WG
2005
Springer
15 years 3 months ago
2005
Springer
SWAT
2004
Springer
15 years 3 months ago
2004
Springer