%0 Conference Paper %1 conf/sofsem/KanteLM13 %A Kanté, Mamadou Moustapha %A Laforest, Christian %A Momège, Benjamin %B SOFSEM %D 2013 %E van Emde Boas, Peter %E Groen, Frans C. A. %E Italiano, Giuseppe F. %E Nawrocki, Jerzy R. %E Sack, Harald %I Springer %K dblp %P 257-267 %T An Exact Algorithm to Check the Existence of (Elementary) Paths and a Generalisation of the Cut Problem in Graphs with Forbidden Transitions. %U http://dblp.uni-trier.de/db/conf/sofsem/sofsem2013.html#KanteLM13 %V 7741 %@ 978-3-642-35843-2

@inproceedings{conf/sofsem/KanteLM13, added-at = {2017-05-23T00:00:00.000+0200}, author = {Kanté, Mamadou Moustapha and Laforest, Christian and Momège, Benjamin}, biburl = {https://www.bibsonomy.org/bibtex/28c4af88b911eea084c34af362e8f9e03/dblp}, booktitle = {SOFSEM}, crossref = {conf/sofsem/2013}, editor = {van Emde Boas, Peter and Groen, Frans C. A. and Italiano, Giuseppe F. and Nawrocki, Jerzy R. and Sack, Harald}, ee = {https://doi.org/10.1007/978-3-642-35843-2_23}, interhash = {61ac4d8023357ce624ece069ef2a98da}, intrahash = {8c4af88b911eea084c34af362e8f9e03}, isbn = {978-3-642-35843-2}, keywords = {dblp}, pages = {257-267}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2024-04-10T01:18:38.000+0200}, title = {An Exact Algorithm to Check the Existence of (Elementary) Paths and a Generalisation of the Cut Problem in Graphs with Forbidden Transitions.}, url = {http://dblp.uni-trier.de/db/conf/sofsem/sofsem2013.html#KanteLM13}, volume = 7741, year = 2013 }