We discuss a method for finding the number of realizations in RK of certain simple undirected weighted graphs.
By: Leo Liberti, Carlile Lavor
Published in: Lecture Notes in Computer Science, volume 8085, (no ), pages 224-30 in 2013
Please obtain a copy of this paper from your local library. IBM cannot distribute this paper externally.
Questions about this service can be mailed to reports@us.ibm.com .