Edge sets: an effective evolutionary coding of spanning trees. Raidl, G. R. & Julstrom, B. A. IEEE Trans. Evol. Comput., 7(3):225-239, 2003. Link Paper bibtex @article{journals/tec/RaidlJ03,
added-at = {2020-05-12T00:00:00.000+0200},
author = {Raidl, Günther R. and Julstrom, Bryant A.},
biburl = {https://www.bibsonomy.org/bibtex/27799c53ee3ad70d0f0eeb91d399e6570/dblp},
ee = {https://doi.org/10.1109/TEVC.2002.807275},
interhash = {d50debf56886d7eb3a4798834282c9fc},
intrahash = {7799c53ee3ad70d0f0eeb91d399e6570},
journal = {IEEE Trans. Evol. Comput.},
keywords = {dblp},
number = 3,
pages = {225-239},
timestamp = {2020-05-13T11:41:16.000+0200},
title = {Edge sets: an effective evolutionary coding of spanning trees.},
url = {http://dblp.uni-trier.de/db/journals/tec/tec7.html#RaidlJ03},
volume = 7,
year = 2003
}
Downloads: 0
{"_id":"RhYWzgRL3k5EbzwHK","bibbaseid":"raidl-julstrom-edgesetsaneffectiveevolutionarycodingofspanningtrees-2003","authorIDs":[],"author_short":["Raidl, G. R.","Julstrom, B. A."],"bibdata":{"bibtype":"article","type":"article","added-at":"2020-05-12T00:00:00.000+0200","author":[{"propositions":[],"lastnames":["Raidl"],"firstnames":["Günther","R."],"suffixes":[]},{"propositions":[],"lastnames":["Julstrom"],"firstnames":["Bryant","A."],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/27799c53ee3ad70d0f0eeb91d399e6570/dblp","ee":"https://doi.org/10.1109/TEVC.2002.807275","interhash":"d50debf56886d7eb3a4798834282c9fc","intrahash":"7799c53ee3ad70d0f0eeb91d399e6570","journal":"IEEE Trans. Evol. Comput.","keywords":"dblp","number":"3","pages":"225-239","timestamp":"2020-05-13T11:41:16.000+0200","title":"Edge sets: an effective evolutionary coding of spanning trees.","url":"http://dblp.uni-trier.de/db/journals/tec/tec7.html#RaidlJ03","volume":"7","year":"2003","bibtex":"@article{journals/tec/RaidlJ03,\n added-at = {2020-05-12T00:00:00.000+0200},\n author = {Raidl, Günther R. and Julstrom, Bryant A.},\n biburl = {https://www.bibsonomy.org/bibtex/27799c53ee3ad70d0f0eeb91d399e6570/dblp},\n ee = {https://doi.org/10.1109/TEVC.2002.807275},\n interhash = {d50debf56886d7eb3a4798834282c9fc},\n intrahash = {7799c53ee3ad70d0f0eeb91d399e6570},\n journal = {IEEE Trans. Evol. Comput.},\n keywords = {dblp},\n number = 3,\n pages = {225-239},\n timestamp = {2020-05-13T11:41:16.000+0200},\n title = {Edge sets: an effective evolutionary coding of spanning trees.},\n url = {http://dblp.uni-trier.de/db/journals/tec/tec7.html#RaidlJ03},\n volume = 7,\n year = 2003\n}\n\n","author_short":["Raidl, G. R.","Julstrom, B. A."],"key":"journals/tec/RaidlJ03","id":"journals/tec/RaidlJ03","bibbaseid":"raidl-julstrom-edgesetsaneffectiveevolutionarycodingofspanningtrees-2003","role":"author","urls":{"Link":"https://doi.org/10.1109/TEVC.2002.807275","Paper":"http://dblp.uni-trier.de/db/journals/tec/tec7.html#RaidlJ03"},"keyword":["dblp"],"downloads":0},"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/Gunther?items=1000","creationDate":"2020-11-19T14:18:48.639Z","downloads":0,"keywords":["dblp"],"search_terms":["edge","sets","effective","evolutionary","coding","spanning","trees","raidl","julstrom"],"title":"Edge sets: an effective evolutionary coding of spanning trees.","year":2003,"dataSources":["vx3tQbZepny2tNB7k"]}