779 search results - page 3 / 156 » A graph polynomial for independent sets of bipartite graphs |
COLOGNETWENTE
2007
13 years 9 months ago
2007
We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded gr...
CPC
2006
13 years 8 months ago
2006
We consider instances of the maximum independent set problem that are constructed according to the following semirandom model. Let Gn,p be a random graph, and let S be a set consis...
COLOGNETWENTE
2010
13 years 7 months ago
2010
We present an algorithm for the independent set problem on semi-random graphs, which are generated as follows: An adversary chooses an n-vertex graph, and then each edge is flipp...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We study problems of reconguration of shortest paths in graphs. We prove that the shortest reconguration sequence can be exponential in the size of the graph and that it is NP-hard...
COLOGNETWENTE
2010
13 years 7 months ago
2010
Bisimplicial edges in bipartite graphs are closely related to pivots in Gaussian elimination that avoid turning zeroes into non-zeroes. We present a new deterministic algorithm to...