Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Journal Article
%1 journals/networks/HortonEP03
%A Horton, Steven B.
%A Easton, Todd
%A Parker, R. Gary
%D 2003
%J Networks
%K dblp
%N 3
%P 165-168
%T The linear arrangement problem on recursively constructed graphs.
%U http://dblp.uni-trier.de/db/journals/networks/networks42.html#HortonEP03
%V 42
@article{journals/networks/HortonEP03,
added-at = {2017-12-07T00:00:00.000+0100},
author = {Horton, Steven B. and Easton, Todd and Parker, R. Gary},
biburl = {https://www.bibsonomy.org/bibtex/20f5817c56664c657240461788c4b8985/dblp},
ee = {https://doi.org/10.1002/net.10093},
interhash = {231ef8efc7236aff333691e9cc0184d7},
intrahash = {0f5817c56664c657240461788c4b8985},
journal = {Networks},
keywords = {dblp},
number = 3,
pages = {165-168},
timestamp = {2017-12-08T11:40:37.000+0100},
title = {The linear arrangement problem on recursively constructed graphs.},
url = {http://dblp.uni-trier.de/db/journals/networks/networks42.html#HortonEP03},
volume = 42,
year = 2003
}
