Works (5)

Updated: April 11th, 2023 10:13

2016 journal article

On size-constrained minimum s-t cut problems and size-constrained dense subgraph problems

THEORETICAL COMPUTER SCIENCE, 609, 434–442.

author keywords: At-least-k-subgraph problem; At-most-k-subgraph problem; Approximation algorithm; The minimum s-t cut with at-least-k vertices problem; The minimum s-t cut with at-most-k vertices problem; The minimum s-t cut with exactly k vertices problem
Sources: Web Of Science, ORCID
Added: August 6, 2018

2013 journal article

Discovery of extreme events-related communities in contrasting groups of physical system networks

DATA MINING AND KNOWLEDGE DISCOVERY, 27(2), 225–258.

By: Z. Chen, W. Hendrix, H. Guan*, I. Tetteh, A. Choudhary*, F. Semazzi, N. Samatova

author keywords: Spatio-temporal data mining; Complex network analysis; Community detection; Comparative analysis; Networkmotif detection; Extreme event prediction
Source: Web Of Science
Added: August 6, 2018

2012 journal article

Community-based anomaly detection in evolutionary networks

Journal of Intelligent Information Systems, 39(1), 59–85.

By: Z. Chen, W. Hendrix & N. Samatova

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

2011 journal article

DENSE: efficient and prior knowledge-driven discovery of phenotype-associated protein functional modules

BMC SYSTEMS BIOLOGY, 5.

By: W. Hendrix n, A. Rocha*, K. Padmanabhan, A. Choudhary*, K. Scott*, J. Mihelcic*, N. Samatova

Source: Web Of Science
Added: August 6, 2018

2010 journal article

Theoretical underpinnings for maximal clique enumeration on perturbed graphs

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

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

author keywords: Graph perturbation theory; Maximal clique enumeration; Graph algorithms; Uncertain and noisy data
Source: Web Of Science
Added: August 6, 2018