Hardness and Algorithms for Variants of Line Graphs of Directed Graphs - Université Clermont Auvergne Access content directly
Conference Papers Year : 2013

Dates and versions

hal-02082711 , version 1 (28-03-2019)

Identifiers

Cite

Mourad Baïou, Laurent Beaudou, Zhentao Li, Vincent Limouzy. Hardness and Algorithms for Variants of Line Graphs of Directed Graphs. International Symposium on Algorithms and Computation, Dec 2013, Hong-Kong, China. pp.196-206, ⟨10.1007/978-3-642-45030-3_19⟩. ⟨hal-02082711⟩
43 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More