1999 conference paper

Equivalence classes of circuit mutants for experimental design

Proceedings of the 1999 IEEE International Symposium on Circuits and systems, 6, 432–435.

By: D. Ghosh n & F. Brglez n

TL;DR: A method to generate tightly controlled equivalence classes of circuit mutants, given the graph-based characterization of a reference netlist, which an general may contain cycles is introduced. (via Semantic Scholar)
Source: NC State University Libraries
Added: August 6, 2018

1999 chapter

Heuristics and experimental design for bigraph crossing number minimization

In Algorithm Engineering and Experimentation: International workshop ALENEX '99, Baltimore, MD, USA, Jan. 15-16, 1999. (Vol. 1619, pp. 74–93).

By: M. Stallmann*, F. Brglez* & D. Ghosh*

TL;DR: Two new heuristics that perform well on sparse graphs such as occur in circuit layout problems are presented and outperform existing heuristic on graph classes that range from application-specific to random. (via Semantic Scholar)
Sources: NC State University Libraries, NC State University Libraries
Added: August 6, 2018

Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.

Certain data included herein are derived from the Web of Science© and InCites© (2024) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.