5473 search results - page 53 / 1095 » On the graph isomorphism problem |
RANDOM
2001
Springer
15 years 4 months ago
2001
Springer
d Abstract) Noga Alon1, , Michael Capalbo2, , Yoshiharu Kohayakawa3, , Vojtˇech R¨odl4,† , Andrzej Ruci´nski5,‡ , and Endre Szemer´edi6,§ 1 Department of Mathematics, Raym...
COCO
2010
Springer
14 years 9 months ago
2010
Springer
An even cycle in a graph is called nice by Lov
FSTTCS
2005
Springer
15 years 5 months ago
2005
Springer
We investigate the s-t-connectivity problem for directed planar graphs, which is hard for L and is contained in NL but is not known to be complete. We show that this problem is log...
116
click to vote
ICALP
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We develop a generic framework for deriving linear-size problem kernels for NP-hard problems on planar graphs. We demonstrate the usefulness of our framework in several c...
110
click to vote
ECCC
2010
14 years 6 months ago
2010
Consider a graph obtained by taking an edge disjoint union of k complete bipartite graphs.