1963 search results - page 10 / 393 » The Maximum Solution Problem on Graphs |
CPM
2009
Springer
15 years 9 months ago
2009
Springer
172
click to vote
DAM
2011
14 years 9 months ago
2011
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...
109
Voted
WADS
2007
Springer
15 years 8 months ago
2007
Springer
In the maximum sharing problem (MS), we want to compute a set of (non-simple) paths in an undirected bipartite graph covering as many nodes as possible of the first layer of the ...
143
click to vote
CATS
2006
15 years 3 months ago
2006
We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number...
121
click to vote
ORL
2007
15 years 1 months ago
2007
We prove that it is NP-complete to decide whether a bipartite graph of maximum degree three on nk vertices can be partitioned into n paths of length k. Finally, we propose some ap...