scholarly journals The Kontsevich graph orientation morphism revisited

2021 ◽  
Vol 123 ◽  
pp. 123-139
Author(s):  
Arthemy V. Kiselev ◽  
Ricardo Buring
Keyword(s):  
2011 ◽  
Vol 6 (1) ◽  
pp. 21 ◽  
Author(s):  
Britta Dorn ◽  
Falk Hüffner ◽  
Dominikus Krüger ◽  
Rolf Niedermeier ◽  
Johannes Uhlmann

Author(s):  
Yuichi Asahiro ◽  
Jesper Jansson ◽  
Eiji Miyano ◽  
Hirotaka Ono

Algorithmica ◽  
2011 ◽  
Vol 65 (2) ◽  
pp. 317-338
Author(s):  
Takehiro Ito ◽  
Yuichiro Miyamoto ◽  
Hirotaka Ono ◽  
Hisao Tamaki ◽  
Ryuhei Uehara
Keyword(s):  

Author(s):  
Yuichi Asahiro ◽  
Jesper Jansson ◽  
Eiji Miyano ◽  
Hesam Nikpey ◽  
Hirotaka Ono
Keyword(s):  

2018 ◽  
Author(s):  
Thinh D. Nguyen

We show that it is hard to orient a digraph such that all nodes in a given subset have in- or out-degree 0, and every other node positive indegree.


Algorithmica ◽  
2018 ◽  
Vol 82 (2) ◽  
pp. 245-259 ◽  
Author(s):  
Edvin Berglin ◽  
Gerth Stølting Brodal

Sign in / Sign up

Export Citation Format

Share Document