Results 1 -
2 of
2
Novel Approaches for Analyzing Biological Networks
- Journal of Combinatorial Optimization
, 2005
"... This paper proposes clique relaxations to identify clusters in biological networks. In particular, the maximum n-clique and maximum n-club problems on an arbitrary graph are introduced and their recognition versions are shown to be NP -complete. In addition, integer programming formulations are ..."
Abstract
-
Cited by 6 (2 self)
- Add to MetaCart
This paper proposes clique relaxations to identify clusters in biological networks. In particular, the maximum n-clique and maximum n-club problems on an arbitrary graph are introduced and their recognition versions are shown to be NP -complete. In addition, integer programming formulations are proposed and the results of sample numerical experiments performed on biological networks are reported.
4. TITLE AND SUBTITLE Information Operations in Pursuit of Terrorists 5. FUNDING NUMBERS
, 2007
"... Public reporting burden for this collection of information is estimated to average 1 hour per response, including the time for reviewing instruction, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. Send comments ..."
Abstract
- Add to MetaCart
Public reporting burden for this collection of information is estimated to average 1 hour per response, including the time for reviewing instruction, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. Send comments regarding this burden estimate or any other aspect of this collection of information, including suggestions for reducing this burden, to Washington headquarters Services, Directorate for Information Operations and Reports, 1215
