z-logo
open-access-imgOpen Access
On the Complexity of two Problems on Orientations of Mixed Graphs
Author(s) -
Guillaume Fertin,
Hafedh Mohamed-Babou,
Irena Rusu
Publication year - 2012
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - directed graph , undirected graph , graph , computer science , combinatorics , path (computing) , biological network , mixed graph , mathematics , line graph , voltage graph , programming language

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here