1736 search results - page 43 / 348 » On antimagic directed graphs |
EJC
2007
13 years 7 months ago
2007
We develop a theory of representations in Rm for directed strongly regular graphs, which gives a new proof of a nonexistence condition of Jørgensen [8]. We also describe some new...
UAI
2003
13 years 9 months ago
2003
We analyze a new property of directed acyclic graphs (DAGs), called layerwidth, arising from a class of DAGs proposed by Eiter and Lukasiewicz. This class of DAGs permits certain ...
SODA
2007
ACM
13 years 9 months ago
2007
ACM
We obtain the first approximation algorithm for finding the k-simple shortest paths connecting a pair of vertices in a weighted directed graph. Our algorithm is deterministic an...
INFOVIS
1997
IEEE
13 years 12 months ago
1997
IEEE
We present the H3 layout technique for drawing large directed graphs as node-link diagrams in 3D hyperbolic space. We can lay out much larger structures than can be handled using ...
IADIS
2008
13 years 9 months ago
2008
We present how to efficiently mine a set of directed acyclic graphs (DAGs) for unconnected, both multi- or single-rooted, and induced fragments. With a new canonical form that is ...