William T. Hendrix

Works (5)

Updated: July 6th, 2023 11:35

2015 journal article

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

THEORETICAL COMPUTER SCIENCE, 609, 434–442.

By: W. Chen *, N. Samatova n, M. Stallmann n , W. Hendrix n & W. Ying *

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
TL;DR: The minimum s-t cut with at-least-k vertices problem, the minimum s -t cutWith at-most-k-subgraph problem, and the Minimum s-T cut with exactly k vertices problems are introduced and it is proved that they are NP-complete. (via Semantic Scholar)
UN Sustainable Development Goals Color Wheel
UN Sustainable Development Goal Categories
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2012 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 n, W. Hendrix n, H. Guan*, I. Tetteh n, A. Choudhary *, F. Semazzi n, N. Samatova*

author keywords: Spatio-temporal data mining; Complex network analysis; Community detection; Comparative analysis; Networkmotif detection; Extreme event prediction
TL;DR: This paper forms a novel problem—detection of predictive and phase-biased communities in contrasting groups of networks, and proposes an efficient and effective machine learning solution for finding such anomalous communities. (via Semantic Scholar)
UN Sustainable Development Goals Color Wheel
UN Sustainable Development Goal Categories
13. Climate Action (Web of Science; OpenAlex)
Source: Web Of Science
Added: August 6, 2018

2011 journal article

Community-based anomaly detection in evolutionary networks

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

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

TL;DR: This work develops a parameter-free and scalable algorithm using a proposed representative-based technique to detect all six possible types of community-based anomalies: grown, shrunken, merged, split, born, and vanished communities, and detail the underlying theory required to guarantee the correctness of the algorithm. (via Semantic Scholar)
UN Sustainable Development Goals Color Wheel
UN Sustainable Development Goal Categories
13. Climate Action (OpenAlex)
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 n, A. Choudhary*, K. Scott *, J. Mihelcic *, N. Samatova n

MeSH headings : Animals; Binding Sites; Cattle; Cell Movement; Cells, Cultured; Computer Simulation; Extracellular Matrix / metabolism; Fibronectins / metabolism; Humans; Models, Biological; Neuropilin-1 / metabolism; Pancreatic Elastase / metabolism; Phenotype; Rats; Receptors, Vascular Endothelial Growth Factor / metabolism; Signal Transduction; Systems Biology; Vascular Endothelial Growth Factor A / chemistry; Vascular Endothelial Growth Factor A / metabolism; Vascular Endothelial Growth Factor A / physiology
TL;DR: A fast and theoretically guranteed method called DENSE (Dense and ENriched Subgraph Enumeration) that can take in as input a biologist's prior knowledge as a set of query proteins and identify all the dense functional modules in a biological network that contain some part of the query vertices is introduced. (via Semantic Scholar)
UN Sustainable Development Goals Color Wheel
UN Sustainable Development Goal Categories
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 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)
UN Sustainable Development Goals Color Wheel
UN Sustainable Development Goal Categories
Source: Web Of Science
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© (2025) 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.