4797 search results - page 14 / 960 » The complexity of partition tasks |
111
click to vote
CATS
2008
15 years 1 months ago
2008
The problem of deciding whether the edge-set of a given graph can be partitioned into at most k cliques is well known to be NP-complete. In this paper we investigate this problem ...
102
click to vote
ICIC
2007
Springer
15 years 5 months ago
2007
Springer
: - This paper introduces the main ideas of the nested partitions (NP) method, analyses its efficiency theoretically and proposes the way to improve the optimization efficiency of ...
DAM
2008
14 years 11 months ago
2008
Given a graph G = (V, E) and a positive integer k, the PARTITION INTO CLIQUES (PIC) decision problem consists of deciding whether there exists a partition of V into k disjoint sub...
HICSS
2003
IEEE
15 years 5 months ago
2003
IEEE
This paper1 provides a view of modeling the information dominance problem of military systems as representative of modeling other complex systems. The ideas are an extension of ea...
63
Voted
STACS
2009
Springer
15 years 6 months ago
2009
Springer
