Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,166,761 papers from all fields of science
Search
Sign In
Create Free Account
Directed graph
Known as:
Graph arc
, Weighted digraph
, Digraph (mathematics)
Expand
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Binary tree
Bipartite realization problem
Büchi automaton
Commitment ordering
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
On Clustering Graph Streams
C. Aggarwal
,
Yuchen Zhao
,
Philip S. Yu
SDM
2010
Corpus ID: 1461726
In this paper, we will examine the problem of clustering massive graph streams. Graph clustering poses significant challenges…
Expand
Highly Cited
2003
Highly Cited
2003
Email Virus Propagation Modeling and Analysis
C. Zou
,
D. Towsley
,
W. Gong
2003
Corpus ID: 9982103
Email viruses constitute one of the major Internet security problems. In this paper we present an email virus model that accounts…
Expand
Highly Cited
2003
Highly Cited
2003
On the performance of graph-based scheduling algorithms for packet radio networks
A. Behzad
,
I. Rubin
GLOBECOM '03. IEEE Global Telecommunications…
2003
Corpus ID: 28126241
Many published algorithms used for scheduling transmissions in packet radio networks are based on finding maximal independent…
Expand
Highly Cited
1997
Highly Cited
1997
lamda-tau-Space Representation of Images and Generalized Edge Detector
M. Gökmen
,
Anil K. Jain
IEEE Transactions on Pattern Analysis and Machine…
1997
Corpus ID: 41234967
An image and surface representation based on regularization theory is introduced in this paper. This representation is based on a…
Expand
Highly Cited
1996
Highly Cited
1996
Cost evaluation in design with form features
Chang-Xue Feng
,
A. Kusiak
,
Chun-Che Huang
Comput. Aided Des.
1996
Corpus ID: 14639205
Highly Cited
1992
Highly Cited
1992
Finding disjoint paths with different path-costs: Complexity and algorithms
Chung-Lun Li
,
S. McCormick
,
D. Simchi-Levi
Networks
1992
Corpus ID: 33637724
Consider a network G = (V,E) with distinguished vertices s and t, and with k different costs on every edge. We consider the…
Expand
Highly Cited
1987
Highly Cited
1987
A Methodology for Knowledge Acquisition and Reasoning in Failure Analysis of Systems
N. Narayanan
,
N. Viswanadham
IEEE Transactions on Systems, Man and Cybernetics
1987
Corpus ID: 26496910
The problem of modeling knowledge about the fault behavior of a system and utilizing this model for reasoning about and…
Expand
Highly Cited
1985
Highly Cited
1985
Fault-Tolerant Routing in DeBruijn Comrnunication Networks
A. Esfahanian
,
S. Hakimi
IEEE transactions on computers
1985
Corpus ID: 8854940
A class of communication networks which is suitable for "multiple processor systems" was studied by Pradhan and Reddy. The…
Expand
Highly Cited
1971
Highly Cited
1971
Pair Grammars, Graph Languages and String-to-Graph Translations
T. W. Pratt
Journal of computer and system sciences (Print)
1971
Corpus ID: 205894879
Highly Cited
1970
Highly Cited
1970
An Algorithm for the Reliability Evaluation of Redundant Networks
K. Misra
1970
Corpus ID: 60650937
An algorithm is presented for evaluation of reliability of any redundant network. It uses the properties of digraphs and is…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE