Efficiently Listing Bounded Length st-Paths

Lecture Notes in Computer Science - Combinatorial Algorithms ◽

10.1007/978-3-319-19315-1_28 ◽

2015 ◽

pp. 318-329 ◽

Cited By ~ 5

Author(s):

Romeo Rizzi ◽

Gustavo Sacomoto ◽

Marie-France Sagot

Download Full-text