Sciweavers

Share
4653 search results - page 1 / 931
» Properties of NP-Complete Sets
Sort
View
COCO
1989
Springer
97views Algorithms» more  COCO 1989»
9 years 2 months ago
On the Structure of Bounded Queries to Arbitrary NP Sets
Kadin [6] showed that if the Polynomial Hierarchy (PH) has infinitely many levels, then for all k, PSAT[k] ⊂ PSAT[k+1]. This paper extends Kadin’s technique and shows that a p...
Richard Chang
TON
2012
7 years 26 days ago
On New Approaches of Assessing Network Vulnerability: Hardness and Approximation
—Society relies heavily on its networked physical infrastructure and information systems. Accurately assessing the vulnerability of these systems against disruptive events is vit...
Thang N. Dinh, Ying Xuan, My T. Thai, Panos M. Par...
DM
2010
128views more  DM 2010»
8 years 10 months ago
Some remarks on the geodetic number of a graph
A set of vertices D of a graph G is geodetic if every vertex of G lies on a shortest path between two not necessarily distinct vertices in D. The geodetic number of G is the minimu...
Mitre Costa Dourado, Fábio Protti, Dieter R...
RECOMB
2010
Springer
8 years 8 months ago
Consistency of Sequence-Based Gene Clusters
In comparative genomics, various combinatorial models can be used to specify gene clusters — groups of genes that are co-located in a set of genomes. Several approaches have been...
Roland Wittler, Jens Stoye
CEC
2005
IEEE
9 years 12 days ago
Final exam scheduler - FES
Timetabling problems are constraint optimization problems proven to be NP complete. Furthermore, evaluation of violations is costly, and there is no common data format for represen...
Ender Özcan, Ersan Ersoy
books