1648 search results - page 49 / 330 » On the generation of bicliques of a graph |
GBRPR
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We present a direct algorithm that computes a largest common connected induced subgraph of two given graphs. It is based on an efficient generation of the common connecte...
FOSSACS
2006
Springer
15 years 1 months ago
2006
Springer
We consider parity games played on special pushdown graphs, namely those generated by one-counter processes. For parity games on pushdown graphs, it is known from [22] that decidin...
COMBINATORICS
2007
14 years 9 months ago
2007
We compute the spectrum of the Schreier graph of the symmetric group Sn corresponding to the Young subgroup S2 × Sn−2 and the generating set consisting of initial reversals. In ...
101
click to vote
COLOGNETWENTE
2010
14 years 8 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...
119
click to vote
ESA
2007
Springer
15 years 3 months ago
2007
Springer
We present an experimental evaluation of an approximate distance oracle recently suggested by Thorup [1] for undirected planar graphs. The oracle uses the existence of graph separa...