Matches in DBpedia 2016-04 for { ?s ?p "In the mathematical domain of graph theory, a bidirected graph (introduced by Edmonds & Johnson 1970) is a graph in which each edge is given an independent orientation (or direction, or arrow) at each end."@en }
Showing triples 1 to 2 of
2
with 100 triples per page.
- Bidirected_graph comment "In the mathematical domain of graph theory, a bidirected graph (introduced by Edmonds & Johnson 1970) is a graph in which each edge is given an independent orientation (or direction, or arrow) at each end.".
- Q4904180 comment "In the mathematical domain of graph theory, a bidirected graph (introduced by Edmonds & Johnson 1970) is a graph in which each edge is given an independent orientation (or direction, or arrow) at each end.".