1736 search results - page 6 / 348 » On antimagic directed graphs |
161
click to vote
ESA
2009
Springer
16 years 16 days ago
2009
Springer
In this paper we present an O(n log n) algorithm for finding a maximum flow in a directed planar graph, where the vertices are subject to capacity constraints, in addition to the...
178
click to vote
ECCV
2004
Springer
16 years 7 months ago
2004
Springer
In recent work, we presented a framework for many-to-many matching of multi-scale feature hierarchies, in which features and their relations were captured in a vertex-labeled, edge...
172
click to vote
GLOBECOM
2007
IEEE
16 years 9 days ago
2007
IEEE
—In this paper, we clarify inter-link interference in wireless ad-hoc networks by using link-directional interference graphs (l-graph). Most of the interference graphs in the lit...
172
click to vote
SPIRE
2001
Springer
15 years 10 months ago
2001
Springer
The Compact Directed Acyclic Word Graph (CDAWG) is a space efficient data structure that supports indices of a string. The Symmetric Directed Acyclic Word Graph (SCDAWG) for a st...
146
click to vote
GD
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We introduce a new graph drawing convention for 3D hierarchical drawings of directed graphs. The vertex set is partitioned into layers of vertices drawn in parallel plane...