1736 search results - page 3 / 348 » On antimagic directed graphs |
FSTTCS
2005
Springer
13 years 11 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...
INFOCOM
2012
IEEE
11 years 7 months ago
2012
IEEE
Abstract—Despite recent efforts to characterize complex networks such as citation graphs or online social networks (OSNs), little attention has been given to developing tools tha...
STOC
2006
ACM
14 years 5 months ago
2006
ACM
SODA
2010
ACM
14 years 2 months ago
2010
ACM
JGT
2011
13 years 10 days ago
2011