Skip to search formSkip to main contentSkip to account menu

Directed graph

Known as: Graph arc, Weighted digraph, Digraph (mathematics) 
In mathematics, and more specifically in graph theory, a directed graph (or digraph) is a graph (that is a set of vertices connected by edges), where… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
We present a computational component that allows to evaluate the minimum time necessary to evacuate people from a place (e.g., a… 
2016
2016
Aim of this research is to suggest indicators, based on social network analysis, that distinguish superficial, idiosyncratic and… 
2006
2006
As many people rely on email communications for business and everyday life, Internet email worms constitute one of the major… 
2004
2004
for their help in motivating the design and providing helpful discussions, demonstrations, comments and criticisms. 
2003
2003
This paper presents a novel approach to shape modeling and a model-based image segmentation procedure tailor-made for the… 
Highly Cited
1997
Highly Cited
1997
An image and surface representation based on regularization theory is introduced in this paper. This representation is based on a… 
1989
1989
We define congestion in a packet network to be the state where performance degrades due to the saturation of a network resource… 
1988
1988
A digraph is said to be a c-circulant if its adjacency matrix is c-circulant. This paper deals with general properties of this… 
1987
1987
A new graph-theoretic representation of the placement of rectangular IC blocks of arbitrary size and aspect ratio is proposed… 
1980
1980
A new proof of Tutte’s trinity theorem (Proc. Cambridge Phil. Soc., 1948), (North-Holland, 1973) is presented. The proof is based…