%0 Journal Article %1 journals/jlp/AkkanDK05 %A Akkan, Can %A Drexl, Andreas %A Kimms, Alf %D 2005 %J J. Log. Algebr. Program. %K dblp %N 1 %P 1-39 %T Generating two-terminal directed acyclic graphs with a given complexity index by constraint logic programming. %U http://dblp.uni-trier.de/db/journals/jlp/jlp62.html#AkkanDK05 %V 62

@article{journals/jlp/AkkanDK05, added-at = {2005-02-21T00:00:00.000+0100}, author = {Akkan, Can and Drexl, Andreas and Kimms, Alf}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/21ba170a10bbab52c6b666ae3d7754e44/dblp}, ee = {http://dx.doi.org/10.1016/S1567-8326(03)00057-2}, interhash = {9998ce27e50e5afd128590859d8df6dc}, intrahash = {1ba170a10bbab52c6b666ae3d7754e44}, journal = {J. Log. Algebr. Program.}, keywords = {dblp}, number = 1, pages = {1-39}, timestamp = {2016-02-02T10:00:12.000+0100}, title = {Generating two-terminal directed acyclic graphs with a given complexity index by constraint logic programming.}, url = {http://dblp.uni-trier.de/db/journals/jlp/jlp62.html#AkkanDK05}, volume = 62, year = 2005 }