Works (3)

Updated: July 5th, 2023 15:48

2010 journal article

Theoretical underpinnings for maximal clique enumeration on perturbed graphs

THEORETICAL COMPUTER SCIENCE, 411(26-28), 2520–2536.

By: W. Hendrix n, M. Schmidt n, P. Breimyer n & N. Samatova n

author keywords: Graph perturbation theory; Maximal clique enumeration; Graph algorithms; Uncertain and noisy data
TL;DR: By enumerating only the difference set between the baseline and perturbed graphs' MCEs, the computational cost of enumerating the maximal cliques of the perturbed graph can be reduced. (via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018

2009 conference paper

BioDEAL: community generation of biological annotations

BMC Medical Informatics and Decision Making, 9.

By: P. Breimyer, N. Green, V. Kumar & N. Samatova

Source: NC State University Libraries
Added: August 6, 2018

conference paper

Coupling graph perturbation theory with scalable parallel algorithms for large-scale enumeration of maximal cliques in biological graphs - art. no. 012053

Samatova, N. F., Schmidt, M. C., Hendrix, W., Breimyer, P., Thomas, K., & Park, B. H. Scidac 2008: Scientific discovery through advanced computing, 125, 12053–12053.

By: N. Samatova, M. Schmidt, W. Hendrix, P. Breimyer, K. Thomas & B. Park

Source: 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.