1736 search results - page 8 / 348 » On antimagic directed graphs |
PRICAI
2004
Springer
14 years 27 days ago
2004
Springer
We propose a methodology for representing artificial creatures like 3D flowers. Directed graph and Lindenmayer system (L-system) are commonly involved in AI-based creativity resear...
SAS
2009
Springer
14 years 8 months ago
2009
Springer
Directed model checking is a well-established technique to tackle the state explosion problem when the aim is to find error states in large systems. In this approach, the state spa...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
We develop a new technique for computing maximum flow in directed planar graphs with multiple sources and a single sink that significantly deviates from previously known techniqu...
LPAR
2004
Springer
14 years 27 days ago
2004
Springer
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
ACSC
2007
IEEE
14 years 1 months ago
2007
IEEE
This paper presents new algorithms for computing single source shortest paths (SSSPs) in a nearly acyclic directed graph G. The first part introduces higher-order decomposition. ...