Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 236,790,142 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.
2004
2004
On the complexity of vertex-disjoint length-restricted path problems
A. Bley
Computational Complexity
2004
Corpus ID: 12112308
Abstract Let $G=(V,E)$ be a simple graph and $s$ and $t$ be two distinct vertices of $G$. A path in $G$ is called \lb for some…
Expand
2004
2004
Creating a distributed field robot architecture for multiple robots
M. Long
2004
Corpus ID: 51786502
for their help in motivating the design and providing helpful discussions, demonstrations, comments and criticisms.
2003
2003
Graphical Gaussian Shape Models and Their Application to Image Segmentation
Anke Neumann
IEEE Transactions on Pattern Analysis and Machine…
2003
Corpus ID: 27653790
This paper presents a novel approach to shape modeling and a model-based image segmentation procedure tailor-made for the…
Expand
2001
2001
Classification of Homomorphisms to Oriented Cycles and of k-Partite Satisfiability
T. Feder
SIAM Journal on Discrete Mathematics
2001
Corpus ID: 26465507
We show that, for every choice of an oriented cycle H, the problem of whether an input digraph G has a homomorphism to H is…
Expand
Highly Cited
2000
Highly Cited
2000
Improving the Up ∗ /Down ∗ Routing Scheme for Networks of Workstations (cid:1)
J. Sancho
,
A. Robles
2000
Corpus ID: 27872345
. Networks of workstations (NOWs) are being considered as a cost-effective alternative to parallel computers. Many NOWs are…
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
1990
1990
Dense bipartite digraphs
M. A. Fiol
,
J. Yebra
Journal of Graph Theory
1990
Corpus ID: 33017483
For its implications in the design of interconnection networks, it is interesting to find (a) (di)graphs with given…
Expand
1989
1989
Congestion control in BBN packet-switched networks
J. Robinson
,
D. Friedman
,
M. Steenstrup
CCRV
1989
Corpus ID: 17076448
We define congestion in a packet network to be the state where performance degrades due to the saturation of a network resource…
Expand
1986
1986
GISMO: A Visual Problem-Structuring and Knowledge-Organization Tool
W. E. Pracht
IEEE Transactions on Systems, Man and Cybernetics
1986
Corpus ID: 30947216
A visual problem-structuring and knowledge-organization technique applicable to complex unstructured decisionmaking situations is…
Expand
1975
1975
Program graphs, an algebra, and their implication for programming
M. Paige
IEEE Transactions on Software Engineering
1975
Corpus ID: 16116585
Program graphs have been used as a vehicle to focus attention on the structure of a program. A systematic methodology for…
Expand