%0 Journal Article %1 journals/computing/KuglerP80 %A Kugler, K.-P. %A Pape, Uwe %D 1980 %J Computing %K dblp %N 2-3 %P 269-274 %T Algorithmus 41 Ein Algorithmus zum vollständigen Durchlaufen eines ungerichteten, zusammenhängenden Graphen. %U http://dblp.uni-trier.de/db/journals/computing/computing24.html#KuglerP80 %V 24

@article{journals/computing/KuglerP80, added-at = {2020-08-06T00:00:00.000+0200}, author = {Kugler, K.-P. and Pape, Uwe}, biburl = {https://www.bibsonomy.org/bibtex/218716e0222d1700dddf0ba49c1eccfe7/dblp}, ee = {https://doi.org/10.1007/BF02281731}, interhash = {a18b2dfaf124e1841d7abec0f75134e8}, intrahash = {18716e0222d1700dddf0ba49c1eccfe7}, journal = {Computing}, keywords = {dblp}, number = {2-3}, pages = {269-274}, timestamp = {2020-08-07T11:49:24.000+0200}, title = {Algorithmus 41 Ein Algorithmus zum vollständigen Durchlaufen eines ungerichteten, zusammenhängenden Graphen.}, url = {http://dblp.uni-trier.de/db/journals/computing/computing24.html#KuglerP80}, volume = 24, year = 1980 }