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/dam/FeigenbaumHS85
%A Feigenbaum, Joan
%A Hershberger, John
%A Schäffer, Alejandro A.
%D 1985
%J Discrete Applied Mathematics
%K dblp
%N 2
%P 123-138
%T A polynomial time algorithm for finding the prime factors of cartesian-product graphs.
%U http://dblp.uni-trier.de/db/journals/dam/dam12.html#FeigenbaumHS85
%V 12
@article{journals/dam/FeigenbaumHS85,
added-at = {2018-11-14T00:00:00.000+0100},
author = {Feigenbaum, Joan and Hershberger, John and Schäffer, Alejandro A.},
biburl = {https://puma.ub.uni-stuttgart.de/bibtex/26f7617cf564be0c12a21623f736db7e5/dblp},
ee = {https://www.wikidata.org/entity/Q56688308},
interhash = {4d3c8ada64ad2fbe8693065b195dcd2c},
intrahash = {6f7617cf564be0c12a21623f736db7e5},
journal = {Discrete Applied Mathematics},
keywords = {dblp},
number = 2,
pages = {123-138},
timestamp = {2019-09-27T10:32:37.000+0200},
title = {A polynomial time algorithm for finding the prime factors of cartesian-product graphs.},
url = {http://dblp.uni-trier.de/db/journals/dam/dam12.html#FeigenbaumHS85},
volume = 12,
year = 1985
}