5473 search results - page 57 / 1095 » On the graph isomorphism problem |
COCO
2006
Springer
15 years 3 months ago
2006
Springer
We study the complexity of restricted versions of s-t-connectivity, which is the standard complete problem for NL. In particular, we focus on different classes of planar graphs, o...
SODA
2008
ACM
15 years 1 months ago
2008
ACM
STOC
2006
ACM
16 years 5 days ago
2006
ACM
SODA
2010
ACM
15 years 9 months ago
2010
ACM
MFCS
2009
Springer
15 years 6 months ago
2009
Springer
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it ...