1736 search results - page 20 / 348 » On antimagic directed graphs |
IJCGA
2010
13 years 4 months ago
2010
A two-dimensional direction-length framework is a pair (G, p), where G = (V ; D, L) is a graph whose edges are labeled as `direction' or `length' edges, and a map p from...
STOC
2006
ACM
14 years 1 months ago
2006
ACM
We show that for any constant ε > 0, there is no Ω(log1−ε M)approximation algorithm for the directed congestion minimization problem on networks of size M unless NP ⊆ Z...
PDP
2007
IEEE
14 years 1 months ago
2007
IEEE
We present an algorithm to compute the cycle structure of large directed graphs where each node has exactly one outgoing edge. Such graphs appear as state diagrams of finite stat...
DCC
2007
IEEE
14 years 7 months ago
2007
IEEE
This work is motivated by the necessity to automate the discovery of structure in vast and evergrowing collection of relational data commonly represented as graphs, for example ge...
FSTTCS
2008
Springer
13 years 8 months ago
2008
Springer
ABSTRACT. We study the problem of space-efficient polynomial-time algorithms for directed stconnectivity (STCON). Given a directed graph G, and a pair of vertices s, t, the STCON ...