Skip to search formSkip to main contentSkip to account menu

Bidirected graph

In the mathematical domain of graph theory, a bidirected graph (introduced by ) is a graph in which each edge is given an independent orientation (or… 
Wikipedia (opens in a new tab)

Related topics

Related topics

9 relations
Bipartite double coverDirected graphGraph (discrete mathematics)Graph theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Signed analogue of general Kotzig-Lovász decomposition
2019
2019
Constructive Characterization for Bidirected Analogue of Critical Graphs I: Principal Classes of Radials and Semiradials
This paper is the first from serial papers that provide constructive characterizations for classes of bidirected graphs known as… 
2017
2017
Bidirected Graphs I: Signed General Kotzig-Lov\'asz Decomposition
This paper is the first from a series of papers that establish a common analogue of the strong component and basilica… 
2016
2016
Transitive closure and transitive reduction in bidirected graphs
In a bidirected graph, an edge has a direction at each end, so bidirected graphs generalize directed graphs. We generalize the… 
2013
2013
Flows on Bidirected Graphs
The study of nowhere-zero flows began with a key observation of Tutte that in planar graphs, nowhere-zero k-flows are dual to k… 
2013
2013
On feedback in Gaussian multi-hop networks
The study of feedback has been mostly limited to single-hop communication settings. In this paper, we consider Gaussian networks… 
2013
2013
On information flow and feedback in relay networks
We consider wireless relay networks where a source node communicates to a destination node with the help of multiple intermediate… 
2008
2008
On a relation between the domination number and a strongly connected bidirection of an undirected graph
2007
2007
Robust Network Coding for Bidirected Networks
We consider the problem of finding a linear network code that guarantees an instantaneous recovery from edge failures in… 
1997
1997
The generalized stable set problem for perfect bidirected graphs
Bidirected graphs are a generalization of undirected graphs. For bidirected graphs, we can consider a problem whichi is a natural… 
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)