4 citations · 6 across the 14 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.DM2015
End-vertices of LBFS of (AT-free) bigraphs
Jan Gorzny, Jing Huang
Lexicographic Breadth First Search (LBFS) is one of fundamental graph search algorithms that has numerous applications, including recognition of graph classes, computation of graph…
cs.DM2015★ 4 cited
Completing orientations of partially oriented graphs
Joergen Bang-Jensen, J. Huang, Xuding Zhu
We initiate a general study of what we call orientation completion problems. For a fixed class C of oriented graphs, the orientation completion problem asks whether a given partial…