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)

Related topics

Related topics

50 relations
Binary treeBipartite realization problemBüchi automatonCommitment ordering

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
General Control Considerations for Input-Series Connected DC/DC Converters
This paper discusses the general control problems of dc/dc converters connected in series at the input. As the input voltage is… 
Highly Cited
2004
Highly Cited
2004
Maximal Clique Based Distributed Coalition Formation for Task Allocation in Large-Scale Multi-agent Systems
We present a fully distributed algorithm for coalition formation among autonomous agents. The algorithm is based on two main… 
Highly Cited
2003
Highly Cited
2003
Email Virus Propagation Modeling and Analysis
Email viruses constitute one of the major Internet security problems. In this paper we present an email virus model that accounts… 
Highly Cited
2003
Highly Cited
2003
On the performance of graph-based scheduling algorithms for packet radio networks
  • A. BehzadI. 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… 
1998
1998
VTDM-a dynamic multicast routing algorithm
In this paper, the dynamic multicast routing problem is studied. The multicast routing problem has been shown to be NP-complete… 
Highly Cited
1997
Highly Cited
1997
lamda-tau-Space Representation of Images and Generalized Edge Detector
An image and surface representation based on regularization theory is introduced in this paper. This representation is based on a… 
Highly Cited
1996
Highly Cited
1996
Cost evaluation in design with form features
Highly Cited
1994
Highly Cited
1994
More facets from fences for linear ordering and acyclic subgraph polytopes
Highly Cited
1985
Highly Cited
1985
Fault-Tolerant Routing in DeBruijn Comrnunication Networks
A class of communication networks which is suitable for "multiple processor systems" was studied by Pradhan and Reddy. The… 
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
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)