Add to ORKGWe 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 of edges within the clusters is maximized (Max-ECP), or the number of edges between clusters is minimized (Min-ECP). These problems arise naturally in the DNA clone classification. We investigate the hardness of finding such partitions and provide approximation algorithms. Further, we show that greedy strategies yield constant factor approxi mations for graph classes for which maximum cliques can be found efficiently
AbstractWe first consider the problem of partitioning the edges of a graph G into bipartite cliques ...
AbstractIn this note, we show that if the maximum clique problem can be solved by a polynomial time ...
AbstractGiven a graph G=(X,U), the problem dealt within this paper consists in partitioning X into a...
We consider the following clustering problems: given an undirected graph, partition its vertices int...
AbstractIn this note, we show that if the maximum clique problem can be solved by a polynomial time ...
AbstractWe study the problem of clique-partitioning a graph. We prove a new general upper bound resu...
AbstractInterval graphs play important roles in analysis of DNA chains in Benzer [S. Benzer, On the ...
Graph partitioning problems enjoy many practical applications as well as algorithmic and theoretical...
T T Te e ec c ch h hn n ni i ic c ca a al l l R R Re e ep p po o or r rt t t A note on the complexit...
In this thesis we study several combinatorial problems in algorithmic graph theory and computational...
Graph partitioning problems enjoy many practical applications as well\ud as algorithmic and theoreti...
AbstractWe first consider the problem of partitioning the edges of a graph G into bipartite cliques ...
AbstractWe study the problem of clique-partitioning a graph. We prove a new general upper bound resu...
We consider a variant of the clustering problem for a complete weighted graph. The aim is to partiti...
We first consider the problem of partitioning the edges of a graph G into bipartite cliques such tha...
AbstractWe first consider the problem of partitioning the edges of a graph G into bipartite cliques ...
AbstractIn this note, we show that if the maximum clique problem can be solved by a polynomial time ...
AbstractGiven a graph G=(X,U), the problem dealt within this paper consists in partitioning X into a...
We consider the following clustering problems: given an undirected graph, partition its vertices int...
AbstractIn this note, we show that if the maximum clique problem can be solved by a polynomial time ...
AbstractWe study the problem of clique-partitioning a graph. We prove a new general upper bound resu...
AbstractInterval graphs play important roles in analysis of DNA chains in Benzer [S. Benzer, On the ...
Graph partitioning problems enjoy many practical applications as well as algorithmic and theoretical...
T T Te e ec c ch h hn n ni i ic c ca a al l l R R Re e ep p po o or r rt t t A note on the complexit...
In this thesis we study several combinatorial problems in algorithmic graph theory and computational...
Graph partitioning problems enjoy many practical applications as well\ud as algorithmic and theoreti...
AbstractWe first consider the problem of partitioning the edges of a graph G into bipartite cliques ...
AbstractWe study the problem of clique-partitioning a graph. We prove a new general upper bound resu...
We consider a variant of the clustering problem for a complete weighted graph. The aim is to partiti...
We first consider the problem of partitioning the edges of a graph G into bipartite cliques such tha...
AbstractWe first consider the problem of partitioning the edges of a graph G into bipartite cliques ...
AbstractIn this note, we show that if the maximum clique problem can be solved by a polynomial time ...
AbstractGiven a graph G=(X,U), the problem dealt within this paper consists in partitioning X into a...